4516 search results - page 107 / 904 » Data Structures in the Design of Interfaces |
113
click to vote
COMPGEOM
2003
ACM
15 years 6 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
118
click to vote
SCN
2008
Springer
15 years 1 months ago
2008
Springer
Abstract-- Despite the rapid advance in networking technologies, detection of network anomalies at high-speed switches/routers is still far from maturity. To push the frontier, two...
136
click to vote
SIGMOD
2010
ACM
15 years 1 months ago
2010
ACM
Automated extraction of structured data from Web sources often leads to large heterogeneous knowledge bases (KB), with data and schema items numbering in the hundreds of thousands...
119
click to vote
LCTRTS
2004
Springer
15 years 6 months ago
2004
Springer
This paper presents Spinach, a new simulator toolset specifically designed to target programmable network interface architectures. Spinach models both system components that are ...
139
click to vote
COCOON
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...