Sciweavers

3367 search results - page 279 / 674
» Incremental assignment problem
Sort
View
JDA
2006
83views more  JDA 2006»
15 years 4 months ago
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
Takehiro Ito, Xiao Zhou, Takao Nishizeki
POPL
1992
ACM
15 years 8 months ago
Abstract Semantics for a Higher-Order Functional Language with Logic Variables
Semantics for a Higher-Order Functional Language with Logic Variables Radha Jagadeesan Imperial College, London, UK SW7 2BZ. Keshav Pingali Cornell University, Ithaca, NY 14853. A...
Radha Jagadeesan, Keshav Pingali
UAI
2008
15 years 5 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
ECCV
2010
Springer
15 years 3 months ago
Sequential Non-Rigid Structure-from-Motion with the 3D-Implicit Low-Rank Shape Model
So far the Non-Rigid Structure-from-Motion problem has been tackled using a batch approach. All the frames are processed at once after the video acquisition takes place. In this pa...
Marco Paladini, Adrien Bartoli, Lourdes de Agapito
TASE
2010
IEEE
14 years 11 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen