7150 search results - page 316 / 1430 » An Approximation Algorithm for Approximation Rank |
157
click to vote
ISAAC
2005
Springer
16 years 6 days ago
2005
Springer
In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate...
147
click to vote
STACS
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
142
click to vote
LATIN
1998
Springer
15 years 11 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
171
Voted
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
— This paper presents a novel swarm approximate dynamic programming method (swarm-ADP) for parameter optimization of PSO systems, from the perspective of optimal control. Based o...
169
click to vote
CCCG
2007
15 years 8 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...