3875 search results - page 681 / 775 » Approximation Algorithms for the Max-coloring Problem |
157
Voted
IPSN
2007
Springer
15 years 8 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...
108
click to vote
MLG
2007
Springer
15 years 8 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...
134
Voted
ECCV
2006
Springer
16 years 4 months ago
2006
Springer
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...
206
click to vote
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
110
click to vote
MSWIM
2005
ACM
15 years 8 months ago
2005
ACM
Emerging multi-hop wireless mesh networks have much different characteristics than the Internet. They have low dimensionality and large diameters. Content and service replication ...