3875 search results - page 644 / 775 » Approximation algorithms for the 0-extension problem |
150
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
142
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each appl...
169
click to vote
IPSN
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
147
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
122
click to vote
MLG
2007
Springer
15 years 10 months ago
2007
Springer
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...