Sciweavers

2994 search results - page 526 / 599
» Time sequences
Sort
View
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
14 years 1 months ago
An Improved LP-based Approximation for Steiner Tree
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...
IFIPTCS
2000
14 years 16 days ago
Masaccio: A Formal Model for Embedded Components
Masaccio is a formal model for hybrid dynamical systems which are built from atomic discrete components (di erence equations) and atomic continuous components (di erential equation...
Thomas A. Henzinger
COMPGEOM
1995
ACM
14 years 15 days ago
The Rectangle Enclosure and Point-Dominance Problems Revisited
We consider the problem of reporting the pairwise enclosures in a set of n axesparallel rectangles in IR2, which is equivalent to reporting dominance pairs in a set of n points in...
Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid...
SODA
1996
ACM
157views Algorithms» more  SODA 1996»
13 years 10 months ago
Routing and Admission Control in General Topology Networks with Poisson Arrivals
Emerging high speed networks will carry tra c for services such as video-on-demand and video teleconferencing that require resource reservation along the path on which the tra c i...
Anil Kamath, Omri Palmon, Serge A. Plotkin
BLISS
2009
IEEE
13 years 10 months ago
Gait Recognition Using Shadow Analysis
The exploitation of biometrics information in human shadow silhouettes (shadow biometrics), derived from video imagery after processing by gait analysis methods opens new avenues ...
Yumi Iwashita, Adrian Stoica