Sciweavers

729 search results - page 61 / 146
» Solving subgraph isomorphism problems with constraint progra...
Sort
View
130
Voted
TVCG
2011
120views more  TVCG 2011»
14 years 10 months ago
Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming
—Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualiz...
Martin Nöllenburg, Alexander Wolff
127
Voted
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
15 years 9 months ago
Unbalanced Graph Cuts
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
Ara Hayrapetyan, David Kempe, Martin Pál, Z...
138
Voted
ICCV
2005
IEEE
16 years 5 months ago
Recovering Human Body Configurations Using Pairwise Constraints between Parts
The goal of this work is to recover human body configurations from static images. Without assuming a priori knowledge of scale, pose or appearance, this problem is extremely chall...
Xiaofeng Ren, Alexander C. Berg, Jitendra Malik
123
Voted
TACAS
2009
Springer
136views Algorithms» more  TACAS 2009»
15 years 10 months ago
Path Feasibility Analysis for String-Manipulating Programs
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
Nikolaj Bjørner, Nikolai Tillmann, Andrei V...
102
Voted
SIAMJO
2008
72views more  SIAMJO 2008»
15 years 3 months ago
A Sample Approximation Approach for Optimization with Probabilistic Constraints
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
James Luedtke, Shabbir Ahmed