554 search results - page 57 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
158
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
166
click to vote
ICRA
2007
IEEE
16 years 4 days ago
2007
IEEE
— Computing optimal paths for mobile robots is an interesting and important problem. This paper presents a method to compute the shortest path for a differential-drive mobile rob...
231
click to vote
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
Many methods for object recognition, segmentation, etc., rely on tessellation of an image into "superpixels". A superpixel is an image patch which is better aligned with ...
138
click to vote
CPAIOR
2009
Springer
16 years 12 days ago
2009
Springer
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
155
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
We consider the problem of performance driven lookup-table (LUT) based technology mapping for FPGAs using a general delay model. In the general delay model, each interconnection e...