256 search results - page 23 / 52 » Short trees in polygons |
166
click to vote
ITIIS
2008
15 years 6 months ago
2008
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...
161
click to vote
EACL
2003
ACL Anthology
15 years 8 months ago
2003
ACL Anthology
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...
169
click to vote
COMPGEOM
2004
ACM
16 years 17 hour ago
2004
ACM
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 ...
179
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
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...
183
click to vote
ICDE
1991
IEEE
15 years 10 months ago
1991
IEEE
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...