Sciweavers

4075 search results - page 203 / 815
» Modeling Distributed Algorithm Using B
Sort
View
INFOCOM
2008
IEEE
16 years 1 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
ICDE
2010
IEEE
249views Database» more  ICDE 2010»
16 years 1 months ago
PARINET: A tunable access method for in-network trajectories
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, ...
PERCOM
2011
ACM
14 years 10 months ago
P3-coupon: A probabilistic system for Prompt and Privacy-preserving electronic coupon distribution
—In this paper, we propose P3 -coupon, a Prompt and Privacy-preserving electronic coupon distribution system based on a Probabilistic one-ownership forwarding algorithm. In this ...
Boying Zhang, Jin Teng, Xiaole Bai, Zhimin Yang, D...
HPDC
1997
IEEE
15 years 10 months ago
A Directory Service for Configuring High-Performance Distributed Computations
High-performance execution in distributed computing environments often requires careful selection and configuration not only of computers, networks, and other resources but also o...
Steven Fitzgerald, Ian T. Foster, Carl Kesselman, ...
RECOMB
2003
Springer
16 years 6 months ago
Maximum entropy modeling of short sequence motifs with applications to RNA splicing signals
We propose a framework for modeling sequence motifs based on the maximum entropy principle (MEP). We recommend approximating short sequence motif distributions with the maximum en...
Gene W. Yeo, Christopher B. Burge