Sciweavers

4377 search results - page 545 / 876
» Mass problems and randomness
Sort
View
ICASSP
2010
IEEE
15 years 7 months ago
Visual localization and segmentation based on foreground/background modeling
In this paper, we propose a novel method to localize (or track) a foreground object and segment the foreground object from the surrounding background with occlusions for a moving ...
Hanzi Wang, Tat-Jun Chin, David Suter
190
Voted
ICASSP
2010
IEEE
15 years 7 months ago
A nullspace analysis of the nuclear norm heuristic for rank minimization
The problem of minimizing the rank of a matrix subject to linear equality constraints arises in applications in machine learning, dimensionality reduction, and control theory, and...
Krishnamurthy Dvijotham, Maryam Fazel
EUROCRYPT
2010
Springer
15 years 7 months ago
On the Impossibility of Three-Move Blind Signature Schemes
We investigate the possibility to prove security of the well-known blind signature schemes by Chaum, and by Pointcheval and Stern in the standard model, i.e., without random oracle...
Marc Fischlin, Dominique Schröder
CACM
2008
53views more  CACM 2008»
15 years 6 months ago
Distributed selection: a missing piece of data aggregation
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
Fabian Kuhn, Thomas Locher, Roger Wattenhofer
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
15 years 6 months ago
Evaluating the impact of AND/OR search on 0-1 integer linear programming
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...
Radu Marinescu 0002, Rina Dechter