Sciweavers

2376 search results - page 432 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
FLAIRS
2008
13 years 11 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
CVPR
2010
IEEE
13 years 11 months ago
Modeling Pixel Process with Scale Invariant Local Patterns for Background Subtraction in Complex Scenes
Background modeling plays an important role in video surveillance, yet in complex scenes it is still a challenging problem. Among many difficulties, problems caused by illuminatio...
Shengcai Liao, Guoying Zhao, Vili Kellokumpu, Matt...
CIKM
2008
Springer
13 years 10 months ago
A note on search based forecasting of ad volume in contextual advertising
In contextual advertising, estimating the number of impressions of an ad is critical in planning and budgeting advertising campaigns. However, producing this forecast, even within...
Xuerui Wang, Andrei Z. Broder, Marcus Fontoura, Va...
CISSE
2008
Springer
13 years 10 months ago
From Constraints to Resolution Rules Part I : conceptual framework
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
Denis Berthier
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 10 months ago
Maximal Quasi-Bicliques with Balanced Noise Tolerance: Concepts and Co-clustering Applications
The rigid all-versus-all adjacency required by a maximal biclique for its two vertex sets is extremely vulnerable to missing data. In the past, several types of quasi-bicliques ha...
Jinyan Li, Kelvin Sim, Guimei Liu, Limsoon Wong