301 search results - page 12 / 61 » Efficient Sketches for the Set Query Problem |
94
Voted
CCCG
2008
15 years 11 days ago
2008
We are interested in the following mesh refinement problem: given an input set of points P in Rd , we would like to produce a good-quality triangulation by adding new points in P....
108
click to vote
ADC
2010
Springer
14 years 6 months ago
2010
Springer
Aggregation against distinct objects has been involved in many real applications with the presence of duplicates, including real-time monitoring moving objects. In this paper, we ...
102
Voted
PPDP
2010
Springer
14 years 8 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
159
click to vote
VLDB
2007
ACM
15 years 11 months ago
2007
ACM
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
EDBT
2004
ACM
15 years 11 months ago
2004
ACM
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...