5595 search results - page 375 / 1119 » Approximation Algorithms for Clustering Problems |
143
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...
160
click to vote
ADCM
2007
15 years 7 months ago
2007
Based on radial basis functions approximation, we develop in this paper a new computational algorithm for numerical differentiation. Under an a priori and an a posteriori choice r...
166
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— We present here an original approach to test the feasibility of footsteps for a given walking pattern generator. It is based on a new approximation algorithm intended to cope w...
192
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— Power efficient operation is very critical in energy constrained multi-hop wireless networks. One important technique is to intelligently assign transmission powers to nodes w...
198
click to vote
ESA
2005
Springer
16 years 7 days ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...