6274 search results - page 1253 / 1255 » From query complexity to computational complexity |
166
click to vote
TASE
2012
IEEE
13 years 5 months ago
2012
IEEE
— This paper presents new results on the formal design of distributed coordinating agents in a discrete-event framework. In this framework, agents are modeled to be individually ...
104
click to vote
MLMI
2004
Springer
15 years 2 months ago
2004
Springer
Combining multiple information sources, typically from several data streams is a very promising approach, both in experiments and to some extend in various real-life applications. ...
STOC
2005
ACM
15 years 3 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
87
Voted
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...