Sciweavers

6799 search results - page 1149 / 1360
» The Tao of Modeling Spaces
Sort
View
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
16 years 3 days ago
Exploiting the Tradeoff Between Precision and Cpu-Time to Speed Up Nearest Neighbor Search
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
Pierre Roy, Jean-Julien Aucouturier, Franço...
LSSC
2005
Springer
16 years 3 days ago
A Multiscale Discontinuous Galerkin Method
We propose a new class of Discontinuous Galerkin (DG) methods based on variational multiscale ideas. Our approach begins with an additive decomposition of the discontinuous finite...
Pavel B. Bochev, Thomas J. R. Hughes, Guglielmo Sc...
SPIRE
2005
Springer
16 years 3 days ago
Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups
Large inverted indices are by now common in the construction of web-scale search engines. For faster access, inverted indices are indexed internally so that it is possible to skip...
Paolo Boldi, Sebastiano Vigna
VLDB
2005
ACM
139views Database» more  VLDB 2005»
16 years 2 days ago
Analyzing Plan Diagrams of Database Query Optimizers
A “plan diagram” is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. In this paper, we present and an...
Naveen Reddy, Jayant R. Haritsa
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
16 years 2 days ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
« Prev « First page 1149 / 1360 Last » Next »