Sciweavers

2880 search results - page 212 / 576
» Approximate Range Searching
Sort
View
AINA
2006
IEEE
15 years 10 months ago
Efficient Packet Matching for Gigabit Network Intrusion Detection using TCAMs
Ternary content-addressable memories (TCAMs) have gained wide acceptance in the industry for storing and searching patterns in routers. But two important problems block the way to...
Ming Gao, Kenong Zhang, Jiahua Lu
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
15 years 9 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
INFOCOM
2009
IEEE
15 years 10 months ago
Searching for Stability in Interdomain Routing
—The Border Gateway Protocol (BGP) handles the task of establishing routes between the Autonomous Systems (ASes) that make up the Internet. It is known that it is possible for a ...
Rahul Sami, Michael Schapira, Aviv Zohar
SIGMOD
1998
ACM
142views Database» more  SIGMOD 1998»
15 years 8 months ago
Dimensionality Reduction for Similarity Searching in Dynamic Databases
Databases are increasingly being used to store multi-media objects such as maps, images, audio and video. Storage and retrieval of these objects is accomplished using multi-dimens...
Kothuri Venkata Ravi Kanth, Divyakant Agrawal, Amb...
143
Voted
GIS
2002
ACM
15 years 3 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...