554 search results - page 81 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
238
Voted
Publication
"This paper presents an efficient algorithm for solving one sort of region-based active contour models, i.e. the active contours without edges model. We develop the link betwe...
155
click to vote
ESA
1998
Springer
15 years 10 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
176
click to vote
WICON
2008
15 years 7 months ago
2008
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
184
click to vote
IEEEPACT
2008
IEEE
16 years 6 days ago
2008
IEEE
Communication overheads are one of the fundamental challenges in a multiprocessor system. As the number of processors on a chip increases, communication overheads and the distribu...
179
click to vote
CCCG
2008
15 years 7 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...