Sciweavers

409 search results - page 61 / 82
» Polynomial Time Approximation Schemes and Parameterized Comp...
Sort
View
INFOCOM
2010
IEEE
14 years 8 months ago
Routing for Energy Minimization in the Speed Scaling Model
Abstract—We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the ...
Matthew Andrews, Antonio Fernández, Lisa Zh...
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
14 years 1 months ago
Partial pole placement with minimum norm controller
— The problem of placing an arbitrary subset (m) of the (n) closed loop eigenvalues of a nth order continuous time single input linear time invariant(LTI) system, using full stat...
Subashish Datta, Balarko Chaudhuri, Debraj Chakrab...
ICCV
2003
IEEE
15 years 11 months ago
A Non-Iterative Greedy Algorithm for Multi-frame Point Correspondence
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...
Khurram Shafique, Mubarak Shah
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
68
Voted
FOCS
2002
IEEE
15 years 2 months ago
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, M...