Sciweavers

316 search results - page 32 / 64
» On the Space Complexity of Randomized Synchronization
Sort
View
TACAS
2009
Springer
106views Algorithms» more  TACAS 2009»
15 years 4 months ago
Hierarchical Set Decision Diagrams and Regular Models
Abstract. This paper presents algorithms and data structures that exploit a compositional and hierarchical specification to enable more efficient symbolic modelchecking. We encod...
Yann Thierry-Mieg, Denis Poitrenaud, Alexandre Ham...
HICSS
2003
IEEE
132views Biometrics» more  HICSS 2003»
15 years 3 months ago
Supporting Collaborative Exercises for Distance Education
At the German Distance Learning University, collaborative synchronous exercises have been recently identified by students and teachers as an important future form of collaborative...
Jörg M. Haake, Till Schümmer, Anja Haake
ICASSP
2011
IEEE
14 years 1 months ago
Joint disparity and optical flow by correspondence growing
The scene flow in binocular stereo setup is estimated using a seed growing algorithm. A pair of calibrated and synchronized cameras observe a scene and output a sequence of image...
Jan Cech, Radu Horaud
APPROX
2011
Springer
234views Algorithms» more  APPROX 2011»
13 years 10 months ago
Streaming Algorithms with One-Sided Estimation
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
Joshua Brody, David P. Woodruff
FOCS
2006
IEEE
15 years 4 months ago
Higher Lower Bounds for Near-Neighbor and Further Rich Problems
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
Mihai Patrascu, Mikkel Thorup