10051 search results - page 95 / 2011 » A Dynamic Separator Algorithm |
90
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
— We consider packet transmission scheduling at the MAC-layer via adaptive backoff algorithms that are favorable in terms of queue occupancies in a wireless network. General netw...
100
Voted
COMPGEOM
2008
ACM
15 years 2 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
—We study a mobile wireless network where groups or clusters of nodes are intermittently connected via mobile “carriers” (the carriers provide connectivity over time among di...
122
click to vote
ECCV
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The sparse representation has been widely used in many areas and utilized for visual tracking. Tracking with sparse representation is formulated as searching for samples ...
87
Voted
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...