Sciweavers

1480 search results - page 153 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
15 years 4 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
TKDE
2008
121views more  TKDE 2008»
15 years 3 months ago
Schema Matching Using Interattribute Dependencies
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
Jaewoo Kang, Jeffrey F. Naughton
ICPP
2008
IEEE
15 years 9 months ago
Resource Allocation for Distributed Streaming Applications
—We consider resource allocation for distributed streaming applications running in a grid environment, where continuously streaming data needs to be aggregated and processed to p...
Qian Zhu, Gagan Agrawal
DCOSS
2010
Springer
15 years 6 months ago
Fast Decentralized Averaging via Multi-scale Gossip
Abstract. We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Go...
Konstantinos I. Tsianos, Michael G. Rabbat
COMPGEOM
2011
ACM
14 years 6 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...