Sciweavers

273 search results - page 13 / 55
» Can Pure Cutting Plane Algorithms Work
Sort
View
ICFP
1999
ACM
13 years 11 months ago
Type Inference Builds a Short Cut to Deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
Olaf Chitil
EMMCVPR
2007
Springer
14 years 1 months ago
Simulating Classic Mosaics with Graph Cuts
Classic mosaic is one of the oldest and most durable art forms. There has been a growing interest in simulating classic mosaics from digital images recently. To be visually pleasin...
Yu Liu, Olga Veksler, Olivier Juan
GD
2004
Springer
14 years 27 days ago
Intersection Reverse Sequences and Geometric Applications
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
Adam Marcus, Gábor Tardos
ICCAD
2003
IEEE
143views Hardware» more  ICCAD 2003»
14 years 4 months ago
Fractional Cut: Improved Recursive Bisection Placement
In this paper, we present improvements to recursive bisection based placement. In contrast to prior work, our horizontal cut lines are not restricted to row boundaries; this avoid...
Ameya R. Agnihotri, Mehmet Can Yildiz, Ateen Khatk...
ICPR
2008
IEEE
14 years 1 months ago
Video object segmentation based on graph cut with dynamic shape prior constraint
In this work, we present a novel segmentation method for deformable objects in monocular videos. Firstly we introduce the dynamic shape to represent the prior knowledge about obje...
Peng Tang, Lin Gao