32545 search results - page 817 / 6509 » Data Structures and Algorithms |
319
click to vote
COMPGEOM
2011
ACM
14 years 11 months ago
2011
ACM
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
225
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
: In a data warehousing process, the phase of data integration is crucial. Many methods for data integration have been published in the literature. However, with the development of...
323
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
214
click to vote
RCIS
2010
15 years 6 months ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
189
click to vote
ISAAC
2007
Springer
16 years 1 months ago
2007
Springer
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...