Sciweavers

420 search results - page 66 / 84
» Some Algorithmic Problems in Polytope Theory
Sort
View
PPDP
2010
Springer
14 years 8 months ago
A declarative approach to robust weighted Max-SAT
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
Miquel Bofill, Dídac Busquets, Mateu Villar...
ICCV
2009
IEEE
14 years 7 months ago
A robust boosting tracker with minimum error bound in a co-training framework
The varying object appearance and unlabeled data from new frames are always the challenging problem in object tracking. Recently machine learning methods are widely applied to tra...
Rong Liu, Jian Cheng, Hanqing Lu
101
Voted
WWW
2009
ACM
15 years 10 months ago
Search shortcuts: driving users towards their goals
Giving suggestions to users of Web-based services is a common practice aimed at enhancing their navigation experience. Major Web Search Engines usually provide Suggestions under t...
Ranieri Baraglia, Fidel Cacheda, Victor Carneiro, ...
86
Voted
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
15 years 4 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
ESOP
2007
Springer
15 years 3 months ago
Anti-pattern Matching
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. In a previous work, we hav...
Claude Kirchner, Radu Kopetz, Pierre-Etienne Morea...