Sciweavers

455 search results - page 15 / 91
» Dynamic well-spaced point sets
Sort
View
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
15 years 3 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
PAMI
2010
161views more  PAMI 2010»
14 years 10 months ago
Nonstationary Shape Activities: Dynamic Models for Landmark Shape Change and Applications
—The goal of this work is to develop statistical models for the shape change of a configuration of “landmark” points (key points of interest) over time and to use these mode...
Samarjit Das, Namrata Vaswani
PAMI
2010
242views more  PAMI 2010»
14 years 10 months ago
Spatiotemporal Saliency in Dynamic Scenes
—A spatiotemporal saliency algorithm based on a center-surround framework is proposed. The algorithm is inspired by biological mechanisms of motion-based perceptual grouping and ...
Vijay Mahadevan, Nuno Vasconcelos
JMLR
2010
103views more  JMLR 2010»
14 years 6 months ago
Learning Nonlinear Dynamic Models from Non-sequenced Data
Virtually all methods of learning dynamic systems from data start from the same basic assumption: the learning algorithm will be given a sequence of data generated from the dynami...
Tzu-Kuo Huang, Le Song, Jeff Schneider
VLDB
2002
ACM
135views Database» more  VLDB 2002»
14 years 11 months ago
Maintaining Coherency of Dynamic Data in Cooperating Repositories
In this paper, we consider techniques for disseminating dynamic data--such as stock prices and real-time weather information--from sources to a set of repositories. We focus on th...
Shetal Shah, Krithi Ramamritham, Prashant J. Sheno...