Sciweavers

4343 search results - page 578 / 869
» Improving Visual Matching
Sort
View
FOCS
2006
IEEE
15 years 9 months ago
Higher Lower Bounds for Near-Neighbor and Further Rich Problems
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
Mihai Patrascu, Mikkel Thorup
ACCV
2006
Springer
15 years 9 months ago
Fast Global Motion Estimation Via Iterative Least-Square Method
Abstract. This paper presents a fast algorithm for global motion estimation based on Iterative Least- Square Estimation (ILSE) technique. Compared with the traditional framework, t...
Jia Wang, Haifeng Wang, Qingshan Liu, Hanqing Lu
136
Voted
CP
2005
Springer
15 years 9 months ago
Applying Constraint Programming to Rigid Body Protein Docking
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
Ludwig Krippahl, Pedro Barahona
137
Voted
JSSPP
2004
Springer
15 years 8 months ago
LOMARC - Lookahead Matchmaking for Multi-resource Coscheduling
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latenc...
Angela C. Sodan, Lei Lan
73
Voted
ISCA
2003
IEEE
88views Hardware» more  ISCA 2003»
15 years 8 months ago
Dynamically Managing the Communication-Parallelism Trade-off in Future Clustered Processors
Clustered microarchitectures are an attractive alternative to large monolithic superscalar designs due to their potential for higher clock rates in the face of increasingly wire-d...
Rajeev Balasubramonian, Sandhya Dwarkadas, David H...