235 search results - page 23 / 47 » The Complexity of Separating Points in the Plane |
168
click to vote
CCCG
2008
15 years 7 months ago
2008
Given a set of n points P = {p1, p2, . . . , pn} in the plane, we show how to preprocess P such that for any query line segment L we can report in O(log n) time the smallest enclo...
173
click to vote
NIPS
2001
15 years 7 months ago
2001
We introduce a new type of Self-Organizing Map (SOM) to navigate in the Semantic Space of large text collections. We propose a "hyperbolic SOM" (HSOM) based on a regular...
181
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...
167
click to vote
KDD
2000
ACM
15 years 9 months ago
2000
ACM
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
144
click to vote
SMI
2005
IEEE
15 years 11 months ago
2005
IEEE
We present an approach to hierarchically encode the topology of functions over triangulated surfaces. We describe the topology of a function by its Morse-Smale complex, a well kno...