Sciweavers

9520 search results - page 1802 / 1904
» is 2011
Sort
View
ICALP
2011
Springer
14 years 7 months ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...
ICALP
2011
Springer
14 years 7 months ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
ICDCN
2011
Springer
14 years 7 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
ICDE
2011
IEEE
274views Database» more  ICDE 2011»
14 years 7 months ago
Collaborative caching for spatial queries in Mobile P2P Networks
Abstract—We propose a novel collaborative caching framework to support spatial query processing in Mobile Peer-toPeer Networks (MP2PNs). To maximize cache sharing among clients, ...
Qijun Zhu, Dik Lun Lee, Wang-Chien Lee
ICDE
2011
IEEE
224views Database» more  ICDE 2011»
14 years 7 months ago
SmartTrace: Finding similar trajectories in smartphone networks without disclosing the traces
—In this demonstration paper, we present a powerful distributed framework for finding similar trajectories in a smartphone network, without disclosing the traces of participatin...
Costandinos Costa, Christos Laoudias, Demetrios Ze...
« Prev « First page 1802 / 1904 Last » Next »