Sciweavers

117 search results - page 16 / 24
» Anti-Sniffing in Unbounded Networks
Sort
View
RTCSA
2003
IEEE
15 years 3 months ago
An Approximation Algorithm for Broadcast Scheduling in Heterogeneous Clusters
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...
Pangfeng Liu, Da-Wei Wang, Yi-Heng Guo
ANNPR
2006
Springer
15 years 1 months ago
Incremental Training of Support Vector Machines Using Truncated Hypercones
We discuss incremental training of support vector machines in which we approximate the regions, where support vector candidates exist, by truncated hypercones. We generate the trun...
Shinya Katagiri, Shigeo Abe
EUC
2008
Springer
14 years 11 months ago
RT-P2P: A Scalable Real-Time Peer-to-Peer System with Probabilistic Timing Assurances
We present RT-P2P, a real-time peer-to-peer (P2P) system that allows application-level end-to-end timing requirements to be satisfied in P2P systems. P2P systems are fundamentally...
Fei Huang, Binoy Ravindran, E. Douglas Jensen
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 9 months ago
Continuum Percolation in the Intrinsically Secure Communications Graph
The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...
Pedro C. Pinto, Moe Z. Win
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 3 days ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar