Sciweavers

2485 search results - page 317 / 497
» Time Bounded Frequency Computations
Sort
View
DC
2010
13 years 8 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie
IJCGA
2007
55views more  IJCGA 2007»
13 years 8 months ago
Parabola Separation Queries and their Application to Stone Throwing
Given two sets A and B of m non-intersecting line segments in the plane, we show how to compute in O(m log m) time a data structure that uses O(m) space and allows to answer the fo...
Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvai...
SIGPRO
2008
136views more  SIGPRO 2008»
13 years 8 months ago
Estimation of slowly varying parameters in nonlinear systems via symbolic dynamic filtering
This paper introduces a novel method for real-time estimation of slowly varying parameters in nonlinear dynamical systems. The core concept is built upon the principles of symboli...
Venkatesh Rajagopalan, Subhadeep Chakraborty, Asok...
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 8 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
HYBRID
2007
Springer
14 years 2 months ago
Symbolic Analysis for GSMP Models with One Stateful Clock
We consider the problem of verifying reachability properties of stochastic real-time systems modeled as generalized semi-Markov processes (GSMPs). The standard simulation-based tec...
Mikhail Bernadsky, Rajeev Alur