Sciweavers

2421 search results - page 177 / 485
» Approximate Flow-Aware Networking
Sort
View
169
Voted
PODC
2010
ACM
15 years 7 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela
UAI
1998
15 years 4 months ago
Tractable Inference for Complex Stochastic Processes
The monitoring and control of any dynamic system depends crucially on the ability to reason about its current status and its future trajectory. In the case of a stochastic system,...
Xavier Boyen, Daphne Koller
131
Voted
TIT
1998
126views more  TIT 1998»
15 years 3 months ago
An Asymptotic Property of Model Selection Criteria
—Probability models are estimated by use of penalized log-likelihood criteria related to AIC and MDL. The accuracies of the density estimators are shown to be related to the trad...
Yuhong Yang, Andrew R. Barron
AMI
2010
Springer
15 years 2 months ago
A Distributed Many-Camera System for Multi-person Tracking
This article presents a modular, distributed and scalable many-camera system designed towards tracking multiple people simultaneously in a natural human-robot interaction scenario ...
Claus Lenz, Thorsten Röder, Martin Eggers, Si...
118
Voted
ATMOS
2010
163views Optimization» more  ATMOS 2010»
15 years 2 months ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...