11231 search results - page 61 / 2247 » Digging for Data Structures |
160
click to vote
ICNP
2007
IEEE
16 years 14 days ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
164
click to vote
ACMMSP
2005
ACM
15 years 11 months ago
2005
ACM
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
187
click to vote
NAR
2011
14 years 9 months ago
2011
IEDB-3D is the 3D structural component of the Immune Epitope Database (IEDB) available via the ‘Browse by 3D Structure’ page at http://www.iedb .org. IEDB-3D catalogs B- and T...
198
click to vote
WDAS
2000
15 years 7 months ago
2000
Present databases, whether on centralized or parallel DBMSs, do not deal well with scalability. We present an architecture for Wintel multicomputers termed AMOS-SDDS, coupling a h...
139
click to vote
PKDD
1999
Springer
15 years 10 months ago
1999
Springer
This paper addresses the problem of learning from highly structured data. Speci cally, it describes a procedure, called decomposition, that allows a learner to access automatically...