Sciweavers

19130 search results - page 199 / 3826
» Modelling multi-path problems
Sort
View
MVA
2008
201views Computer Vision» more  MVA 2008»
15 years 6 months ago
How close are we to solving the problem of automated visual surveillance?
The problem of automated visual surveillance has spawned a lively research area, with 2005 seeing three conferences or workshops and special issues of two major journals devoted to...
Hannah M. Dee, Sergio A. Velastin
JUCS
2007
118views more  JUCS 2007»
15 years 6 months ago
Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
Gabriel Istrate
ASC
2004
15 years 6 months ago
Solving nonconvex climate control problems: pitfalls and algorithm performances
Global optimization can be used as the main component for reliable decision support systems. In this contribution, we explore numerical solution techniques for nonconvex and nondi...
Carmen G. Moles, Julio R. Banga, Klaus Keller
CLASSIFICATION
2004
59views more  CLASSIFICATION 2004»
15 years 6 months ago
Oscillation Heuristics for the Two-group Classification Problem
: We propose a new nonparametric family of oscillation heuristics for improving linear classifiers in the two-group discriminant problem. The heuristics are motivated by the intuit...
Ognian Asparouhov, Paul A. Rubin
CORR
2010
Springer
119views Education» more  CORR 2010»
15 years 5 months ago
Computational Complexity of Avalanches in the Kadanoff two-dimensional Sandpile Model
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
Eric Goles Chacc, Bruno Martin