Sciweavers

6506 search results - page 1152 / 1302
» Algorithmic models for sensor networks
Sort
View
SDM
2007
SIAM
152views Data Mining» more  SDM 2007»
14 years 11 months ago
HP2PC: Scalable Hierarchically-Distributed Peer-to-Peer Clustering
In distributed data mining models, adopting a flat node distribution model can affect scalability. To address the problem of modularity, flexibility and scalability, we propose...
Khaled M. Hammouda, Mohamed S. Kamel
NIPS
2000
14 years 11 months ago
Discovering Hidden Variables: A Structure-Based Approach
A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. As s...
Gal Elidan, Noam Lotner, Nir Friedman, Daphne Koll...
ATMOS
2007
177views Optimization» more  ATMOS 2007»
14 years 11 months ago
Approximate dynamic programming for rail operations
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
Warren B. Powell, Belgacem Bouzaïene-Ayari
IMC
2006
ACM
15 years 4 months ago
A structural approach to latency prediction
Several models have been recently proposed for predicting the latency of end to end Internet paths. These models treat the Internet as a black-box, ignoring its internal structure...
Harsha V. Madhyastha, Thomas E. Anderson, Arvind K...
CSFW
2012
IEEE
13 years 16 days ago
Provably Secure and Practical Onion Routing
The onion routing network Tor is undoubtedly the most widely employed technology for anonymous web access. Although the underlying onion routing (OR) protocol appears satisfactory...
Michael Backes, Ian Goldberg, Aniket Kate, Esfandi...
« Prev « First page 1152 / 1302 Last » Next »