Radix

Results: 307



#Item
91

PDF Document

Add to Reading List

Source URL: www.cs.virginia.edu

Language: English - Date: 2003-08-06 22:04:14
92CMYK  Nxxx,,A,001,Bs-4C,E2 Late Edition Today, mostly sunny, a warmer afternoon, high 78. Tonight, clear

CMYK Nxxx,,A,001,Bs-4C,E2 Late Edition Today, mostly sunny, a warmer afternoon, high 78. Tonight, clear

Add to Reading List

Source URL: www.nytimes.com

Language: English - Date: 2015-05-07 03:40:57
93ISSN 0910−0865  環境変異原研究 Environmental Mutagen Research

ISSN 0910−0865 環境変異原研究 Environmental Mutagen Research

Add to Reading List

Source URL: www.j-ems.org

Language: English - Date: 2008-07-30 05:48:24
94Technology  The Index The ScaleDB technology is based on a compressed form of tries called Patricia tries. A Patricia trie differs from a standard trie in that nodes with one child are compressed into their parent node,

Technology The Index The ScaleDB technology is based on a compressed form of tries called Patricia tries. A Patricia trie differs from a standard trie in that nodes with one child are compressed into their parent node,

Add to Reading List

Source URL: scaledb.com

Language: English - Date: 2014-06-24 22:17:50
95Outline  Introduction Related Work

Outline Introduction Related Work

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2004-07-10 16:11:04
96RadixVM: Scalable address spaces for multithreaded applications Austin T. Clements, M. Frans Kaashoek, and Nickolai Zeldovich MIT CSAIL A BSTRACT

RadixVM: Scalable address spaces for multithreaded applications Austin T. Clements, M. Frans Kaashoek, and Nickolai Zeldovich MIT CSAIL A BSTRACT

Add to Reading List

Source URL: pdos.csail.mit.edu

Language: English - Date: 2015-04-29 10:31:16
97High Performance GraphicsC. Dachsbacher, J. Munkberg, and J. Pantaleoni (Editors) Maximizing Parallelism in the Construction of BVHs, Octrees, and k-d Trees Tero Karras

High Performance GraphicsC. Dachsbacher, J. Munkberg, and J. Pantaleoni (Editors) Maximizing Parallelism in the Construction of BVHs, Octrees, and k-d Trees Tero Karras

Add to Reading List

Source URL: devblogs.nvidia.com

Language: English - Date: 2015-01-29 19:09:45
98 	
  	
    	
      	
  

           

Add to Reading List

Source URL: cuba.coventry.ac.uk

Language: English - Date: 2013-02-27 05:50:34
99Dynamic Pipelining: Making IP-Lookup Truly Scalable Jahangir Hasan T. N. Vijaykumar  {hasanj, vijay} @ecn.purdue.edu

Dynamic Pipelining: Making IP-Lookup Truly Scalable Jahangir Hasan T. N. Vijaykumar {hasanj, vijay} @ecn.purdue.edu

Add to Reading List

Source URL: conferences.sigcomm.org

Language: English - Date: 2005-07-14 13:20:18
100Flattened Butterfly : A Cost-Efficient Topology for High-Radix Networks John Kim, William J. Dally Dennis Abts

Flattened Butterfly : A Cost-Efficient Topology for High-Radix Networks John Kim, William J. Dally Dennis Abts

Add to Reading List

Source URL: cva.stanford.edu

Language: English - Date: 2007-04-03 18:23:10