Sciweavers

256 search results - page 36 / 52
» Short trees in polygons
Sort
View
JQL
2008
97views more  JQL 2008»
13 years 8 months ago
Dependency-length minimization in natural and artificial languages
A wide range of evidence points to a preference for syntactic structures in which dependencies are short. Here we examine the question: what kinds of dependency configurations min...
David Temperley
ALGORITHMICA
2002
101views more  ALGORITHMICA 2002»
13 years 8 months ago
Improved Algorithms for Constructing Fault-Tolerant Spanners
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...
PKDD
2010
Springer
122views Data Mining» more  PKDD 2010»
13 years 7 months ago
Detecting Events in a Million New York Times Articles
We present a demonstration of a newly developed text stream event detection method on over a million articles from the New York Times corpus. The event detection is designed to ope...
Tristan Snowsill, Ilias N. Flaounas, Tijl De Bie, ...
FMCO
2009
Springer
161views Formal Methods» more  FMCO 2009»
13 years 6 months ago
The How and Why of Interactive Markov Chains
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelled transition systems with exponentially delayed transitions. We show that IMCs a...
Holger Hermanns, Joost-Pieter Katoen
CVPR
2006
IEEE
14 years 10 months ago
Supervised Learning of Edges and Object Boundaries
Edge detection is one of the most studied problems in computer vision, yet it remains a very challenging task. It is difficult since often the decision for an edge cannot be made ...
Piotr Dollár, Zhuowen Tu, Serge Belongie