35 search results - page 2 / 7 » Computing contour trees in all dimensions |
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
—We study the problem of data-driven routing and navigation in a distributed sensor network over a continuous scalar field. Specifically, we address the problem of searching fo...
108
Voted
FOCS
1992
IEEE
15 years 4 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
121
Voted
JMLR
2010
14 years 11 months ago
2010
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
99
Voted
COCOON
2006
Springer
15 years 4 months ago
2006
Springer
We consider the problems of straightening polygonal trees and convexifying polygons by continuous motions such that rigid edges can rotate around vertex joints and no edge crossing...
126
click to vote
CVPR
2000
IEEE
16 years 2 months ago
2000
IEEE
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consum...