Sciweavers

2880 search results - page 383 / 576
» Approximate Range Searching
Sort
View
130
Voted
EDBT
2004
ACM
131views Database» more  EDBT 2004»
16 years 3 months ago
A Framework for Access Methods for Versioned Data
This paper presents a framework for understanding and constructing access methods for versioned data. Records are associated with version ranges in a version tree. A minimal repre...
Betty Salzberg, Linan Jiang, David B. Lomet, Manue...
HOTOS
2003
IEEE
15 years 8 months ago
Towards a Semantic-Aware File Store
—Traditional hierarchical namespaces are not sufficient for representing and managing the rich semantics of today’s storage systems. In this paper, we discuss the principles o...
Zhichen Xu, Magnus Karlsson, Chunqiang Tang, Chris...
ISCAPDCS
2004
15 years 4 months ago
Randomized Sorting on the POPS Network
Partitioned Optical Passive Stars (POPS) network has been presented recently as a desirable model of parallel computation. Several papers have been published that address fundamen...
Jaime Davila, Sanguthevar Rajasekaran
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
16 years 3 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen
124
Voted
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
15 years 10 months ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid