1731 search results - page 235 / 347 » Maximum likelihood analysis of algorithms and data structure... |
JCDL
2006
ACM
14 years 1 months ago
2006
ACM
Tables are used to present, list, summarize, and structure important data in documents. In scholarly articles, they are often used to present the relationships among data and high...
COMPGEOM
2005
ACM
13 years 10 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...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
DOLAP
2006
ACM
14 years 1 months ago
2006
ACM
One of the most important tasks performed in the early stages of a data warehouse project is the analysis of the structure and content of the existing data sources and their inten...