Sciweavers

2190 search results - page 171 / 438
» Incomplete Information Processing for Optimization of Distri...
Sort
View
INFOCOM
2006
IEEE
15 years 9 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
APGV
2008
ACM
145views Visualization» more  APGV 2008»
15 years 4 months ago
On optimal resampling of view and illumination dependent textures
The use of illumination and view dependent textural information is one way to capture the realistic appearance of genuine materials. One example of such data is the bidirectional ...
Jirí Filip, Mike J. Chantler, Michal Haindl
GLOBECOM
2008
IEEE
15 years 9 months ago
Distributed Base Station Cooperation via Block-Diagonalization and Dual-Decomposition
Abstract—It has been recently shown that base station cooperation may yield great capacity improvement in downlink multiple antenna cellular networks. However, the proposed solut...
Yosia Hadisusanto, Lars Thiele, Volker Jungnickel
IPSN
2010
Springer
15 years 9 months ago
Online distributed sensor selection
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
Daniel Golovin, Matthew Faulkner, Andreas Krause
140
Voted
IPTPS
2005
Springer
15 years 8 months ago
Dynamic Load Balancing in Distributed Hash Tables
In Peer-to-Peer networks based on consistent hashing and ring topology each server is responsible for an interval chosen (pseudo-)randomly on a circle. The topology of the network...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...