11211 search results - page 102 / 2243 » Rank-Sensitive Data Structures |
136
click to vote
LWA
2008
15 years 2 months ago
2008
Information extraction is concerned with the location of specific items in (unstructured) textual documents, e.g., being applied for the acquisition of structured data. Then, the ...
ICNP
2007
IEEE
15 years 7 months 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...
112
click to vote
ACMMSP
2005
ACM
15 years 6 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...
141
Voted
WDAS
2000
15 years 2 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...
83
Voted
PKDD
1999
Springer
15 years 5 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...