2252 search results - page 272 / 451 » Lower Bounds for Dynamic Algorithms |
111
Voted
ICRA
1994
IEEE
15 years 7 months ago
1994
IEEE
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
109
Voted
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
140
Voted
ECSQARU
1995
Springer
15 years 7 months ago
1995
Springer
The paper presents a method for uncertainty propagation in Bayesian networks in symbolic, as opposed to numeric, form. The algebraic structure of probabilities is characterized. Th...
129
Voted
STOC
1991
ACM
15 years 7 months ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
135
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...