2424 search results - page 285 / 485 » A general algorithm for data dependence analysis |
167
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...
153
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
126
click to vote
ICCV
1999
IEEE
16 years 6 months ago
1999
IEEE
Automatic grouping and segmentation of images remains a challenging problem in computer vision. Recently, a number of authors have demonstrated good performance on this task using...
185
Voted
RSP
1998
IEEE
15 years 8 months ago
1998
IEEE
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...
121
Voted
DCC
2004
IEEE
16 years 3 months ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...