736 search results - page 78 / 148 » A dynamic data structure for approximate range searching |
ICDE
2009
IEEE
13 years 6 months ago
2009
IEEE
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...
WWW
2005
ACM
14 years 9 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
JSAC
2006
13 years 8 months ago
2006
Abstract--Packet matching plays a critical role in the performance of many network devices and a tremendous amount of research has already been invested to come up with better opti...
PODS
2006
ACM
14 years 8 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
AAAI
1996
13 years 10 months ago
1996
In recent years, compositional modeling and selfexplanatory simulation techniques have simplified the process of building dynamic simulators of physical systems. Building steady-s...