3341 search results - page 73 / 669 » On Bounded Queries and Approximation |
ESANN
2007
14 years 11 months ago
2007
In the paper, the problem of multi-objective (MOBJ) learning is discussed. The problem of obtaining apparent (effective) complexity measure, which is one of the objectives, is con...
CIKM
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...
JIIS
2008
14 years 9 months ago
2008
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...
125
click to vote
DCG
2010
14 years 10 months ago
2010
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
159
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...