273 search results - page 13 / 55 » Can Pure Cutting Plane Algorithms Work |
134
Voted
ICFP
1999
ACM
15 years 8 months ago
1999
ACM
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...
140
Voted
EMMCVPR
2007
Springer
15 years 10 months ago
2007
Springer
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...
137
Voted
GD
2004
Springer
15 years 9 months ago
2004
Springer
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...
125
Voted
ICCAD
2003
IEEE
16 years 20 days ago
2003
IEEE
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...
161
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
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...