Sciweavers

1884 search results - page 107 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
DEDS
2006
101views more  DEDS 2006»
14 years 12 months ago
Near-Optimal Online Control of Dynamic Discrete-Event Systems
A class of time-varying discrete-event systems, named dynamic discrete-event systems, is defined. The goal of this paper is to provide a method which is modular and can be applied ...
Lenko Grigorov, Karen Rudie
MVA
2002
215views Computer Vision» more  MVA 2002»
14 years 11 months ago
Robust Tracking Algorithm Based on Color and Edge Distribution for Real-time Video Based Motion Capture Systems
This paper describes a robust tracking algorithm for real-time, video based motion capture systems. Conventional motion capture systems are unable to capture motion data in real t...
Yoshiaki Akazawa, Yoshihiro Okada, Koichi Niijima
SIGKDD
2000
95views more  SIGKDD 2000»
14 years 11 months ago
Scalability for Clustering Algorithms Revisited
This paper presents a simple new algorithm that performs k-means clustering in one scan of a dataset, while using a bu er for points from the dataset of xed size. Experiments show...
Fredrik Farnstrom, James Lewis, Charles Elkan
ALGOSENSORS
2006
Springer
15 years 3 months ago
Self-deployment Algorithms for Mobile Sensors on a Ring
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
DCG
2000
104views more  DCG 2000»
14 years 11 months ago
Efficient Algorithms for Approximating Polygonal Chains
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
Pankaj K. Agarwal, Kasturi R. Varadarajan