15073 search results - page 295 / 3015 » Probabilistic algorithms for computing resultants |
144
Voted
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
166
click to vote
SIGMETRICS
2006
ACM
16 years 17 days ago
2006
ACM
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
199
click to vote
ECCV
2000
Springer
15 years 11 months ago
2000
Springer
This paper offers a novel detection method, which works well even in the case of a complicated image collection – for instance, a frontal face under a large class of linear tran...
194
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...
299
click to vote
DCOSS
2011
Springer
14 years 6 months ago
2011
Springer
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...