Sciweavers

1529 search results - page 51 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
100
Voted
ENDM
2008
93views more  ENDM 2008»
15 years 3 months ago
The Generalized Max-Controlled Set Problem
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
Ivairton M. Santos, Carlos A. J. Martinhon, Luiz S...
149
Voted
ACIVS
2006
Springer
15 years 9 months ago
A Linear-Time Approach for Image Segmentation Using Graph-Cut Measures
Abstract. Image segmentation using graph cuts have become very popular in the last years. These methods are computationally expensive, even with hard constraints (seed pixels). We ...
Alexandre X. Falcão, Paulo A. V. Miranda, A...
123
Voted
SCALESPACE
2007
Springer
15 years 9 months ago
Linear Image Reconstruction by Sobolev Norms on the Bounded Domain
The reconstruction problem is usually formulated as a variational problem in which one searches for that image that minimizes a so called prior (image model) while insisting on cer...
Bart Janssen, Remco Duits, Bart M. ter Haar Romeny
132
Voted
AAAI
1997
15 years 5 months ago
Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
Aaron A. Armstrong, Edmund H. Durfee
141
Voted
ICML
2005
IEEE
16 years 4 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III