135 search results - page 17 / 27 » Approximability Distance in the Space of H-Colourability Pro... |
129
click to vote
MM
2004
ACM
15 years 5 months ago
2004
ACM
We consider the problem of learning a mapping function from low-level feature space to high-level semantic space. Under the assumption that the data lie on a submanifold embedded ...
AAAI
2007
15 years 2 months ago
2007
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...
108
click to vote
ICIP
2003
IEEE
15 years 5 months ago
2003
IEEE
A method is presented for segmentation of anatomical structures that incorporates prior information about shape. The method iteratively applies steps which find object’s border ...
SODA
2007
ACM
15 years 1 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
102
click to vote
BTW
2007
Springer
15 years 3 months ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...