Sciweavers

3360 search results - page 288 / 672
» Opportunistic Data Structures with Applications
Sort
View
150
Voted
CCCG
2010
15 years 6 months ago
I/O efficient path traversal in well-shaped tetrahedral meshes
We present a data structure which represents a wellshaped convex tetrahedral mesh, M, in linear space such that path traversals visiting a sequence of K tetrahedra require O (K/ l...
Craig Dillabaugh
MIR
2006
ACM
172views Multimedia» more  MIR 2006»
15 years 11 months ago
Combining audio-based similarity with web-based data to accelerate automatic music playlist generation
We present a technique for combining audio signal-based music similarity with web-based musical artist similarity to accelerate the task of automatic playlist generation. We demon...
Peter Knees, Tim Pohle, Markus Schedl, Gerhard Wid...
DNIS
2005
Springer
112views Database» more  DNIS 2005»
15 years 10 months ago
Modelling Peer-to-Peer Data Networks Under Complex System Theory
: A Peer-to-peer Data Network (PDN) is an open and evolving society of peer nodes that assemble into a network to share their data for mutual benefit. PDNs are enabled by distribu...
Cyrus Shahabi, Farnoush Banaei Kashani
ASPLOS
2010
ACM
15 years 8 months ago
Micro-pages: increasing DRAM efficiency with locality-aware data placement
Power consumption and DRAM latencies are serious concerns in modern chip-multiprocessor (CMP or multi-core) based compute systems. The management of the DRAM row buffer can signif...
Kshitij Sudan, Niladrish Chatterjee, David Nellans...
EDBT
2009
ACM
207views Database» more  EDBT 2009»
15 years 8 months ago
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
In emerging applications such as location-based services, sensor monitoring and biological management systems, the values of the database items are naturally imprecise. For these ...
Reynold Cheng, Lei Chen 0002, Jinchuan Chen, Xike ...