Sciweavers

304 search results - page 30 / 61
» Solving Generalized Small Inverse Problems
Sort
View
ICIP
2009
IEEE
14 years 8 months ago
Segmentation On Surfaces With The Closest Point Method
We propose a method to detect objects and patterns in textures on general surfaces. Our approach applies the Chan?Vese variational model for active contours without edges to the p...
STOC
2006
ACM
112views Algorithms» more  STOC 2006»
14 years 1 months ago
Limitations of quantum coset states for graph isomorphism
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
Sean Hallgren, Cristopher Moore, Martin Rötte...
ACCV
2007
Springer
14 years 1 months ago
Flea, Do You Remember Me?
The ability to detect and recognize individuals is essential for an autonomous robot interacting with humans even if computational resources are usually rather limited. In general ...
Michael Grabner, Helmut Grabner, Joachim Pehserl, ...
TIT
2010
130views Education» more  TIT 2010»
13 years 2 months ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
ASIACRYPT
2007
Springer
14 years 1 months ago
When e-th Roots Become Easier Than Factoring
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
Antoine Joux, David Naccache, Emmanuel Thomé...