Sciweavers

6365 search results - page 365 / 1273
» Fast Local Computation Algorithms
Sort
View
CVPR
2009
IEEE
17 years 1 months ago
Projective Least-Squares: Global Solutions with Local Optimization
Recent work in multiple view geometry has focused on obtaining globally optimal solutions at the price of computational time efciency. On the other hand, traditional bundle adj...
Carl Olsson, Fredrik Kahl, Richard I. Hartley
APPROX
2008
Springer
190views Algorithms» more  APPROX 2008»
15 years 8 months ago
The Complexity of Local List Decoding
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
Dan Gutfreund, Guy N. Rothblum
CLUSTER
2004
IEEE
15 years 10 months ago
Predicting memory-access cost based on data-access patterns
Improving memory performance at software level is more effective in reducing the rapidly expanding gap between processor and memory performance. Loop transformations (e.g. loop un...
Surendra Byna, Xian-He Sun, William Gropp, Rajeev ...
ICPR
2010
IEEE
15 years 11 months ago
Learning an Efficient and Robust Graph Matching Procedure for Specific Object Recognition
We present a fast and robust graph matching approach for 2D specific object recognition in images. From a small number of training images, a model graph of the object to learn is a...
Jerome Revaud, Guillaume Lavoue, Yasuo Ariki, Atil...
IEEEPACT
2007
IEEE
16 years 1 months ago
A Flexible Heterogeneous Multi-Core Architecture
Multi-core processors naturally exploit thread-level parallelism (TLP). However, extracting instruction-level parallelism (ILP) from individual applications or threads is still a ...
Miquel Pericàs, Adrián Cristal, Fran...