817 search results - page 27 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
SWAT
2004
Springer
14 years 2 months ago
2004
Springer
For n disjoint line segments in the plane we can construct a binary encompassing tree such that every vertex is pointed, what’s more, at every segment endpoint all incident edges...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
We present a simple linear time algorithm for drawing level graphs with a given ordering of the vertices within each level. The algorithm draws in a radial fashion without changing...
WWW
2009
ACM
14 years 9 months ago
2009
ACM
Much of the information on the Web is found in articles from online news outlets, magazines, encyclopedias, review collections, and other sources. However, extracting this content...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
KDD
2000
ACM
14 years 6 days ago
2000
ACM
Periodicy detection in time series data is a challenging problem of great importance in many applications. Most previous work focused on mining synchronous periodic patterns and d...