Sciweavers

370 search results - page 66 / 74
» Computational Study on Dominating Set Problem of Planar Grap...
Sort
View
AUTOMATICA
2006
106views more  AUTOMATICA 2006»
14 years 11 months ago
Decentralized receding horizon control for large scale dynamically decoupled systems
A detailed study on the design of decentralized Receding Horizon Control (RHC) schemes for decoupled systems is presented. An optimal control problem is formulated for a set of de...
Tamás Keviczky, Francesco Borrelli, Gary J....
CVPR
2006
IEEE
16 years 1 months ago
Escaping local minima through hierarchical model selection: Automatic object discovery, segmentation, and tracking in video
Recently, the generative modeling approach to video segmentation has been gaining popularity in the computer vision community. For example, the flexible sprites framework has been...
Nebojsa Jojic, John M. Winn, Larry Zitnick
SPAA
1999
ACM
15 years 3 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 6 days ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams
CIKM
2009
Springer
15 years 6 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...