736 search results - page 91 / 148 » A dynamic data structure for approximate range searching |
VLDB
2004
ACM
14 years 2 months ago
2004
ACM
Cost-based XML query optimization calls for accurate estimation of the selectivity of path expressions. Some other interactive and internet applications can also benefit from suc...
DAC
1999
ACM
14 years 1 months ago
1999
ACM
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
IAT
2007
IEEE
14 years 3 months ago
2007
IEEE
This paper describes an intelligent agent to facilitate bitext mining from the Web via automatic discovery of URL pairing patterns (or keys) for retrieving parallel web pages. The...
IPPS
2005
IEEE
2005
IEEE
Building on a Framework: Using FG for More Flexibility and Improved Performance in Parallel Programs
14 years 2 months ago
We describe new features of FG that are designed to improve performance and extend the range of computations that fit into its framework. FG (short for Framework Generator) is a ...
TKDE
2010
13 years 7 months ago
2010
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...