Sciweavers

658 search results - page 49 / 132
» Lower bounds for sorting networks
Sort
View
ANTSW
2010
Springer
13 years 2 months ago
Short and Robust Communication Paths in Dynamic Wireless Networks
Abstract. We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when...
Yoann Pigné, Frédéric Guinand
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
14 years 9 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
CORR
2006
Springer
107views Education» more  CORR 2006»
13 years 7 months ago
Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements...
Nan Liu, Sennur Ulukus
PVLDB
2011
13 years 2 months ago
Personalized Social Recommendations - Accurate or Private?
With the recent surge of social networks such as Facebook, new forms of recommendations have become possible – recommendations that rely on one’s social connections in order t...
Ashwin Machanavajjhala, Aleksandra Korolova, Atish...
JOC
2006
71views more  JOC 2006»
13 years 7 months ago
Private Computation: k-Connected versus 1-Connected Networks
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...
Markus Bläser, Andreas Jakoby, Maciej Liskiew...