1802 search results - page 335 / 361 » Sparse Computations with PEI |
110
click to vote
STOC
2003
ACM
16 years 3 days ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
SIGMOD
2002
ACM
15 years 12 months ago
2002
ACM
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
EUROGRAPHICS
2010
Eurographics
15 years 9 months ago
2010
Eurographics
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different...
166
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
We propose a novel tracking algorithm that can work robustly in a challenging scenario such that several kinds of appearance and motion changes of an object occur at the same time....
104
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
We address the character identification problem in
movies and television videos: assigning names to faces on
the screen. Most prior work on person recognition in video
assumes s...