499 search results - page 21 / 100 » On the Decay of Crossing Numbers |
SWAT
1998
Springer
14 years 7 days ago
1998
Springer
Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...
NIPS
2004
13 years 9 months ago
2004
We propose to selectively remove examples from the training set using probabilistic estimates related to editing algorithms (Devijver and Kittler, 1982). This heuristic procedure ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
INFFUS
2006
13 years 8 months ago
2006
A distributed detection and decision fusion scheme is proposed for a wireless sensor network (WSN) consisting of a large number of sensors. At the fusion center, the total number ...
COMPGEOM
2000
ACM
14 years 12 days ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...