Sciweavers

1578 search results - page 259 / 316
» Algorithmic randomness of continuous functions
Sort
View
COCO
2008
Springer
146views Algorithms» more  COCO 2008»
13 years 10 months ago
A Direct Product Theorem for Discrepancy
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
Troy Lee, Adi Shraibman, Robert Spalek
ICASSP
2010
IEEE
13 years 9 months ago
Motion estimation from compressed linear measurements
This paper presents a novel algorithm for computing the relative motion between images from compressed linear measurements. We propose a geometry based correlation model that desc...
Vijayaraghavan Thirumalai, Pascal Frossard
IVC
2007
114views more  IVC 2007»
13 years 8 months ago
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
TCOS
2010
13 years 7 months ago
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
We present a general framework for computing two-dimensional Voronoi diagrams of different classes of sites under various distance functions. Most diagrams mentioned in the paper ...
Ophir Setter, Micha Sharir, Dan Halperin
ICCAD
2009
IEEE
119views Hardware» more  ICCAD 2009»
13 years 6 months ago
Iterative layering: Optimizing arithmetic circuits by structuring the information flow
Current logic synthesis techniques are ineffective for arithmetic circuits. They perform poorly for XOR-dominated circuits, and those with a high fan-in dependency between inputs ...
Ajay K. Verma, Philip Brisk, Paolo Ienne