Sciweavers

125 search results - page 18 / 25
» A Recursive Embedding Approach to Median Graph Computation
Sort
View
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
13 years 7 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
ICCV
2007
IEEE
14 years 9 months ago
Untangling Cycles for Contour Grouping
We introduce a novel topological formulation for contour grouping. Our grouping criterion, called untangling cycles, exploits the inherent topological 1D structure of salient cont...
Qihui Zhu, Gang Song, Jianbo Shi
JMLR
2008
94views more  JMLR 2008»
13 years 7 months ago
Using Markov Blankets for Causal Structure Learning
We show how a generic feature selection algorithm returning strongly relevant variables can be turned into a causal structure learning algorithm. We prove this under the Faithfuln...
Jean-Philippe Pellet, André Elisseeff
GD
2001
Springer
14 years 8 days ago
Labeling Heuristics for Orthogonal Drawings
This paper studies the problem of computing an orthogonal drawing of a graph with labels along the edges. Labels are not allowed to overlap with each other or with edges to which t...
Carla Binucci, Walter Didimo, Giuseppe Liotta, Mad...
ICPR
2008
IEEE
14 years 9 months ago
HOPS: Efficient region labeling using Higher Order Proxy Neighborhoods
We present the Higher Order Proxy Neighborhoods (HOPS) approach to modeling higher order neighborhoods in Markov Random Fields (MRFs). HOPS incorporates more context information i...
Albert Y. C. Chen, Jason J. Corso, Le Wang