Sciweavers

1033 search results - page 194 / 207
» The Relative History Heuristic
Sort
View
CP
2001
Springer
15 years 4 months ago
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to nd a m...
Peter van Beek, Kent D. Wilken
FOCS
2000
IEEE
15 years 4 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
VR
2000
IEEE
174views Virtual Reality» more  VR 2000»
15 years 4 months ago
Optimization-Based Virtual Surface Contact Manipulation at Force Control Rates
Previous interactive works have used springs, heuristics, and dynamics for surface placement applications. We present an analytical technique for kilohertz rate manipulation of CA...
Donald D. Nelson, Elaine Cohen
VLDB
1999
ACM
118views Database» more  VLDB 1999»
15 years 4 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
VLDB
1998
ACM
108views Database» more  VLDB 1998»
15 years 4 months ago
MindReader: Querying Databases Through Multiple Examples
Users often can not easily express their queries. For example, in a multimedia image by content setting, the user might want photographs with sunsets; in current systems, like QBI...
Yoshiharu Ishikawa, Ravishankar Subramanya, Christ...