25041 search results - page 4373 / 5009 » Algorithms for Clustering Data |
204
click to vote
COMPGEOM
2005
ACM
15 years 9 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
198
click to vote
COMPGEOM
2005
ACM
15 years 9 months ago
2005
ACM
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
188
click to vote
KDD
2010
ACM
15 years 9 months ago
2010
ACM
The increasing availability of large-scale location traces creates unprecedent opportunities to change the paradigm for knowledge discovery in transportation systems. A particular...
210
click to vote
CPM
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
214
click to vote
DGO
2007
15 years 8 months ago
2007
A large portion of the government, business, cultural, and scientific digital data being created today needs to be archived and preserved for future use of periods ranging from a ...