51 search results - page 5 / 11 » A dynamic topological sort algorithm for directed acyclic gr... |
188
Voted
ICIP
2000
IEEE
16 years 6 months ago
2000
IEEE
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
142
click to vote
APPT
2007
Springer
15 years 11 months ago
2007
Springer
It is a great challenge to map network processing tasks to processing resources of advanced network processors, which are heterogeneous and multi-threading multiprocessor System-on...
156
click to vote
WICON
2008
15 years 6 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...
162
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
134
Voted
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...