1632 search results - page 66 / 327 » Sublinear Time Algorithms for Metric Space Problems |
125
click to vote
EUROCAST
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this work we consider the application of metaheuristic algorithms to the problem of fitting rectangular signals to time-data series. The application background is to ...
170
Voted
PDCAT
2005
Springer
15 years 9 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
174
Voted
IPL
2007
15 years 3 months ago
2007
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
117
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
126
click to vote
PODS
2006
ACM
16 years 3 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...