560 search results - page 94 / 112 » Level-set methods for convex optimization |
122
click to vote
ICRA
2007
IEEE
15 years 8 months 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...
102
click to vote
DATE
2003
IEEE
15 years 7 months ago
2003
IEEE
Wireplanning is an approach in which the timing of inputoutput paths is planned before modules are specified, synthesized or sized. If these global wires are optimally segmented ...
119
click to vote
COMPGEOM
1999
ACM
15 years 6 months ago
1999
ACM
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
114
click to vote
NIPS
2008
15 years 3 months ago
2008
We present a multi-label multiple kernel learning (MKL) formulation in which the data are embedded into a low-dimensional space directed by the instancelabel correlations encoded ...
125
click to vote
NIPS
2007
15 years 3 months ago
2007
Active learning sequentially selects unlabeled instances to label with the goal of reducing the effort needed to learn a good classifier. Most previous studies in active learning...