Sciweavers

1722 search results - page 238 / 345
» On the sample mean of graphs
Sort
View
EMMCVPR
2005
Springer
15 years 12 months ago
Probabilistic Subgraph Matching Based on Convex Relaxation
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
Christian Schellewald, Christoph Schnörr
SAT
2005
Springer
133views Hardware» more  SAT 2005»
15 years 11 months ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà
GECCO
2004
Springer
15 years 11 months ago
Real-Coded Bayesian Optimization Algorithm: Bringing the Strength of BOA into the Continuous World
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
Chang Wook Ahn, Rudrapatna S. Ramakrishna, David E...
LION
2010
Springer
188views Optimization» more  LION 2010»
15 years 11 months ago
Grapheur: A Software Architecture for Reactive and Interactive Optimization
Abstract This paper proposes a flexible software architecture for interactive multiobjective optimization, with a user interface for visualizing the results and facilitating the s...
Mauro Brunato, Roberto Battiti
FPL
2001
Springer
96views Hardware» more  FPL 2001»
15 years 10 months ago
System Level Tools for DSP in FPGAs
Abstract. Visual data ow environments are ideally suited for modeling digital signal processing (DSP) systems, as many DSP algorithms are most naturally speci ed by signal ow gra...
James Hwang, Brent Milne, Nabeel Shirazi, Jeffrey ...