Sciweavers

1347 search results - page 180 / 270
» On the Structure of the Minimum Time Function
Sort
View
ATAL
2006
Springer
15 years 8 months ago
Tractable negotiation in tree-structured domains
Multiagent resource allocation is a timely and exciting area of research at the interface of Computer Science and Economics. One of the main challenges in this area is the high co...
Yann Chevaleyre, Ulle Endriss, Nicolas Maudet
CACM
2010
161views more  CACM 2010»
15 years 2 months ago
Efficiently searching for similar images
As it becomes increasingly viable to capture, store, and share large amounts of image and video data, automatic image analysis is crucial to managing visual information. Many prob...
Kristen Grauman
MP
2008
99views more  MP 2008»
15 years 4 months ago
Efficient robust optimization for robust control with constraints
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
Paul J. Goulart, Eric C. Kerrigan, Daniel Ralph
IPMI
2003
Springer
16 years 5 months ago
Meshfree Representation and Computation: Applications to Cardiac Motion Analysis
Abstract. For medical image analysis issues where the domain mappings between images involve large geometrical shape changes, such as the cases of nonrigid motion recovery and inte...
Huafeng Liu, Pengcheng Shi
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
15 years 11 months ago
Approximating Node-Connectivity Augmentation Problems
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Zeev Nutov