512 search results - page 90 / 103 » Anticipating the Digital University |
COMPGEOM
2010
ACM
14 years 20 days ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
COMPGEOM
2010
ACM
14 years 20 days ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
STOC
2010
ACM
14 years 13 days ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
SIGECOM
2010
ACM
14 years 12 days ago
2010
ACM
In 1876 Charles Lutwidge Dodgson suggested the intriguing voting rule that today bears his name. Although Dodgson’s rule is one of the most well-studied voting rules, it suffers...
SIGMOD
2010
ACM
14 years 12 days ago
2010
ACM
The probabilistic threshold query (PTQ) is one of the most common queries in uncertain databases, where all results satisfying the query with probabilities that meet the threshold...