Sciweavers

840 search results - page 113 / 168
» The Complexity of the Extended GCD Problem
Sort
View
TCS
2010
13 years 7 months ago
A hierarchical strongly aperiodic set of tiles in the hyperbolic plane
We give a new construction of strongly aperiodic set of tiles in H2 , exhibiting a kind of hierarchical structure, simplifying the central framework of Margenstern’s proof that t...
Chaim Goodman-Strauss
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 9 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
SIGMOD
2005
ACM
77views Database» more  SIGMOD 2005»
14 years 9 months ago
On Joining and Caching Stochastic Streams
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
Jun Yang 0001, Junyi Xie, Yuguo Chen
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 6 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
ATAL
2007
Springer
14 years 3 months ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker