2219 search results - page 365 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
137
Voted
ISQED
2008
IEEE
15 years 8 months ago
2008
IEEE
—Power and energy consumption has emerged as the premier and most constraining aspect in modern computational systems. Dynamic Voltage Scheduling (DVS) has been provably one of t...
120
Voted
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
102
click to vote
SC
2009
ACM
15 years 9 months ago
2009
ACM
Algorithmic choice is essential in any problem domain to realizing optimal computational performance. Multigrid is a prime example: not only is it possible to make choices at the ...
99
Voted
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
94
Voted
IEEEPACT
2002
IEEE
15 years 7 months ago
2002
IEEE
A static memory reference exhibits a unique property when its dynamic memory addresses are congruent with respect to some non-trivial modulus. Extraction of this congruence inform...