4850 search results - page 71 / 970 » Approximate Data Structures with Applications |
ENTCS
2008
14 years 10 months ago
2008
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
148
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...
COMPGEOM
2001
ACM
15 years 1 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
COOPIS
2004
IEEE
15 years 1 months ago
2004
IEEE
Querying and integrating sources of structured data from the Web in most cases requires similarity-based concepts to deal with data level conflicts. This is due to the often errone...