10988 search results - page 2148 / 2198 » Algorithmic Folding Complexity |
118
Voted
COMPGEOM
2005
ACM
15 years 4 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...
111
click to vote
COMPGEOM
2005
ACM
15 years 4 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...
116
click to vote
KDD
2010
ACM
15 years 4 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...
107
click to vote
CLEF
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we will describe Berkeley's approach to the Domain Specific (DS) track for CLEF 2008. Last year we used Entry Vocabulary Indexes and Thesaurus expansion approac...
137
click to vote
IWMM
2010
Springer
15 years 4 months ago
2010
Springer
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...