Sciweavers

256 search results - page 23 / 52
» Short trees in polygons
Sort
View
ITIIS
2008
84views more  ITIIS 2008»
13 years 8 months ago
A Scalable Recovery Tree Construction Scheme Considering Spatial Locality of Packet Loss
Packet losses tend to occur during short error bursts separated by long periods of relatively error-free transmission. There is also a significant spatial correlation in loss amon...
Jinsuk Baek, Jehan-François Pâris
EACL
2003
ACL Anthology
13 years 10 months ago
Finite Structure Query: A Tool for Querying Syntactically Annotated Corpora
Finite structure query (fsq for short) is a tool for querying syntactically annotated corpora. fsq employs a query language of high expressive power, namely full first order logi...
Stephan Kepser
COMPGEOM
2004
ACM
14 years 2 months ago
Geodesic ham-sandwich cuts
Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is ...
Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, J...
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
14 years 5 days ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
ICDE
1991
IEEE
145views Database» more  ICDE 1991»
14 years 5 days ago
DOT: A Spatial Access Method Using Fractals
Existing Database Management Systems (DBMSs) do not handle efficiently multi-dimensional data such as boxes, polygons, or even points in a multi-dimensional space. We examine acc...
Christos Faloutsos, Yi Rong