2168 search results - page 52 / 434 » Randomized Algorithms and Complexity Theory |
110
Voted
ISSAC
2005
Springer
15 years 8 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
121
Voted
DAGSTUHL
2004
15 years 4 months ago
2004
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
119
Voted
MOBIHOC
2007
ACM
16 years 2 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
124
click to vote
IPSN
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We present a distributed algorithm for environmental monitoring of a scalar field (such as temperature, intensity of light, atmospheric pressure, etc.) using a random se...
101
Voted
ACL
1994
15 years 4 months ago
1994
The paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorit...