133 search results - page 12 / 27 » Approximation bounds for Black Hole Search problems |
178
click to vote
SDM
2012
SIAM
13 years 2 months ago
2012
SIAM
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
113
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
108
click to vote
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
NIPS
2004
15 years 1 months ago
2004
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...