Sciweavers

195 search results - page 26 / 39
» Another View of the Gaussian Algorithm
Sort
View
IJIG
2002
189views more  IJIG 2002»
14 years 9 months ago
Motion Detection from Time-Varied Background
This paper proposes a new background subtraction method for detecting moving objects from a time-varied background. While background subtraction has traditionally worked well for ...
Ying Ren, Chin-Seng Chua, Yeong-Khing Ho
IJCV
2007
120views more  IJCV 2007»
14 years 9 months ago
Projective Visual Hulls
This article presents a novel method for computing the visual hull of a solid bounded by a smooth surface and observed by a finite set of cameras. The visual hull is the intersect...
Svetlana Lazebnik, Yasutaka Furukawa, Jean Ponce
87
Voted
IPPS
2010
IEEE
14 years 7 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
SIGMOD
2011
ACM
152views Database» more  SIGMOD 2011»
14 years 14 days ago
Tracing data errors with view-conditioned causality
A surprising query result is often an indication of errors in the query or the underlying data. Recent work suggests using causal reasoning to find explanations for the surprisin...
Alexandra Meliou, Wolfgang Gatterbauer, Suman Nath...
ASIACRYPT
2011
Springer
13 years 9 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer