Sciweavers

3894 search results - page 546 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
INFOCOM
2008
IEEE
15 years 10 months ago
Maximizing Restorable Throughput in MPLS Networks
Abstract—MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths...
Reuven Cohen, Gabi Nakibly
129
Voted
INFOCOM
2006
IEEE
15 years 10 months ago
A Statistical Framework for Intrusion Detection in Ad Hoc Networks
— We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically fail to detect attacks and also gener...
Dhanant Subhadrabandhu, Saswati Sarkar, Farooq Anj...
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 5 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
110
Voted
NIPS
2007
15 years 5 months ago
Parallelizing Support Vector Machines on Distributed Computers
Support Vector Machines (SVMs) suffer from a widely recognized scalability problem in both memory use and computational time. To improve scalability, we have developed a parallel ...
Edward Y. Chang, Kaihua Zhu, Hao Wang, Hongjie Bai...
AAAI
1998
15 years 5 months ago
Bayesian Network Models for Generation of Crisis Management Training Scenarios
We present a noisy-OR Bayesian network model for simulation-based training, and an efficient search-based algorithm for automatic synthesis of plausible training scenarios from co...
Eugene Grois, William H. Hsu, Mikhail Voloshin, Da...