Sciweavers

ICDE
2011
IEEE
271views Database» more  ICDE 2011»
12 years 8 months ago
Authentication of moving kNN queries
— A moving kNN query continuously reports the k nearest neighbors of a moving query point. In addition to the query result, a service provider that evaluates moving queries often...
Man Lung Yiu, Eric Lo, Duncan Yung
CDC
2009
IEEE
142views Control Systems» more  CDC 2009»
13 years 2 months ago
Asynchronous distributed optimization with minimal communication and connectivity preservation
Abstract-- We consider problems where multiple agents cooperate to control their individual state so as to optimize a common objective while communicating with each other to exchan...
Minyi Zhong, Christos G. Cassandras
IPPS
2010
IEEE
13 years 3 months ago
Performance modeling of heterogeneous systems
Predicting how well applications may run on modern systems is becoming increasingly challenging. It is no longer sufficient to look at number of floating point operations and commu...
Jan Christian Meyer, Anne C. Elster
TPDS
2002
126views more  TPDS 2002»
13 years 4 months ago
P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
Frank J. Seinstra, Dennis Koelma
JACM
2008
90views more  JACM 2008»
13 years 5 months ago
Bit complexity of breaking and achieving symmetry in chains and rings
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
IPL
2008
72views more  IPL 2008»
13 years 5 months ago
Reducing communication costs in robust peer-to-peer networks
Several recent research results describe how to design Distributed Hash Tables (DHTs) that are robust to adversarial attack via Byzantine faults. Unfortunately, all of these resul...
Jared Saia, Maxwell Young
CPAIOR
2008
Springer
13 years 6 months ago
Optimal Deployment of Eventually-Serializable Data Services
Abstract. Replication is a fundamental technique for increasing throughput and achieving fault tolerance in distributed data services. However, its implementation may induce signif...
Laurent Michel, Alexander A. Shvartsman, Elaine L....
ICDCS
2010
IEEE
13 years 9 months ago
Practical Robust Communication in DHTs Tolerating a Byzantine Adversary
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
Maxwell Young, Aniket Kate, Ian Goldberg, Martin K...
MA
1999
Springer
87views Communications» more  MA 1999»
13 years 9 months ago
Disseminating Mobile Agents for Distributed Information Filtering
An often claimed benefit of mobile agent technology is the reduction of communication cost. Especially the area of information filtering has been proposed for the application of...
Wolfgang Theilmann, Kurt Rothermel
EUROPAR
2009
Springer
13 years 9 months ago
Static Worksharing Strategies for Heterogeneous Computers with Unrecoverable Failures
One has a large workload that is “divisible” (its constituent work’s granularity can be adjusted arbitrarily) and one has access to p remote computers that can assist in comp...
Anne Benoit, Yves Robert, Arnold L. Rosenberg, Fr&...