Sciweavers

385 search results - page 34 / 77
» A Fast Algorithm for Matrix Balancing
Sort
View
COMPGEOM
2011
ACM
13 years 1 months ago
Compressive sensing with local geometric features
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachli...
JSC
2011
74views more  JSC 2011»
13 years 5 months ago
Constructive homomorphisms for classical groups
Let Ω ≤ GLd(q) be a quasisimple classical group in its natural representation and let ∆ = NGLd(q)(Ω). We construct the projection from ∆ to ∆/Ω and provide fast, poly...
Scott H. Murray, Colva M. Roney-Dougal
ICRA
2010
IEEE
107views Robotics» more  ICRA 2010»
13 years 8 months ago
Fast resolution of hierarchized inverse kinematics with inequality constraints
— Classically, the inverse kinematics is performed by computing the singular value decomposition of the matrix to invert. This enables a very simple writing of the algorithm. How...
Adrien Escande, Nicolas Mansard, Pierre-Brice Wieb...
ISBI
2008
IEEE
14 years 11 months ago
Fast no ground truth image registration accuracy evaluation: Comparison of bootstrap and Hessian approaches
Image registration algorithms provide a displacement field between two images. We consider the problem of estimating accuracy of the calculated displacement field from the input i...
Jan Kybic
SAT
2005
Springer
162views Hardware» more  SAT 2005»
14 years 3 months ago
Heuristics for Fast Exact Model Counting
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
Tian Sang, Paul Beame, Henry A. Kautz