Sciweavers

1355 search results - page 140 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
CORR
2012
Springer
228views Education» more  CORR 2012»
12 years 4 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
FOSSACS
2010
Springer
14 years 3 months ago
Reachability Analysis of Communicating Pushdown Systems
Abstract. The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here ...
Alexander Heußner, Jérôme Lerou...
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
14 years 3 months ago
Coverage control for nonholonomic agents
— Consider a coverage problem for a team of agents in the plane: target points appear sporadically over time in a bounded environment and must be visited by one of the agents. It...
John Enright, Ketan Savla, Emilio Frazzoli
APPROX
2006
Springer
179views Algorithms» more  APPROX 2006»
14 years 26 days ago
Adaptive Sampling and Fast Low-Rank Matrix Approximation
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
Amit Deshpande, Santosh Vempala
DASFAA
2008
IEEE
116views Database» more  DASFAA 2008»
13 years 11 months ago
MBR Models for Uncertainty Regions of Moving Objects
The increase in the advanced location based services such as traffic coordination and management necessitates the need for advanced models tracking the positions of Moving Objects ...
Shayma Alkobaisi, Wan D. Bae, Seon Ho Kim, Byunggu...