1435 search results - page 267 / 287 » Generalization Error Bounds Using Unlabeled Data |
COMPGEOM
2010
ACM
14 years 14 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...
CIKM
2004
Springer
13 years 11 months ago
2004
Springer
With the growing importance of semi-structure data in information exchange, much research has been done to provide an effective mechanism to match a twig query in an XML database....
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
COMPGEOM
2004
ACM
14 years 25 days ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
CCS
2007
ACM
14 years 1 months ago
2007
ACM
Low-latency anonymity systems such as Tor, AN.ON, Crowds, and Anonymizer.com aim to provide anonymous connections that are both untraceable by “local” adversaries who control ...