Sciweavers

677 search results - page 62 / 136
» Reducing the Space Requirement of LZ-Index
Sort
View
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
15 years 10 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
CORR
2012
Springer
228views Education» more  CORR 2012»
13 years 5 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
DAC
2007
ACM
15 years 11 months ago
Efficient Computation of Buffer Capacities for Cyclo-Static Dataflow Graphs
A key step in the design of cyclo-static real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure, which means that tasks...
Maarten Wiggers, Marco Bekooij, Gerard J. M. Smit
MICRO
2005
IEEE
108views Hardware» more  MICRO 2005»
15 years 3 months ago
How to Fake 1000 Registers
Large numbers of logical registers can improve performance by allowing fast access to multiple subroutine contexts (register windows) and multiple thread contexts (multithreading)...
David W. Oehmke, Nathan L. Binkert, Trevor N. Mudg...
HT
1999
ACM
15 years 2 months ago
Beyond Location: Hypertext Workspaces and Non-Linear Views
With the growth of the Web as a public information resource, users need workspaces to support the collection, evaluation, organization, and annotation of the materials they retrie...
Frank M. Shipman III, Catherine C. Marshall, Mark ...