4541 search results - page 437 / 909 » Cache-Oblivious Algorithms and Data Structures |
182
Voted
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
157
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
223
click to vote
WWW
2009
ACM
16 years 5 months ago
2009
ACM
In this paper, we propose a novel framework called SmartMiner for web usage mining problem which uses link information for producing accurate user sessions and frequent navigation...
231
click to vote
ICDE
2005
IEEE
16 years 6 months ago
2005
IEEE
Releasing person-specific data in its most specific state poses a threat to individual privacy. This paper presents a practical and efficient algorithm for determining a generaliz...
225
click to vote
ICDE
2005
IEEE
16 years 6 months ago
2005
IEEE
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...