Sciweavers

85 search results - page 14 / 17
» Scaling limit of random k-trees
Sort
View
AAAI
2010
15 years 7 months ago
Security Games with Arbitrary Schedules: A Branch and Price Approach
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...
Manish Jain, Erim Kardes, Christopher Kiekintveld,...
TNN
2008
152views more  TNN 2008»
15 years 6 months ago
Distributed Parallel Support Vector Machines in Strongly Connected Networks
We propose a distributed parallel support vector machine (DPSVM) training mechanism in a configurable network environment for distributed data mining. The basic idea is to exchange...
Yumao Lu, Vwani P. Roychowdhury, L. Vandenberghe
IPPS
2010
IEEE
15 years 4 months ago
DEBAR: A scalable high-performance de-duplication storage system for backup and archiving
We present DEBAR, a scalable and high-performance de-duplication storage system for backup and archiving, to overcome the throughput and scalability limitations of the state-of-th...
Tianming Yang, Hong Jiang, Dan Feng, Zhongying Niu...
INFOCOM
2007
IEEE
16 years 22 days ago
The Impact of Stochastic Noisy Feedback on Distributed Network Utility Maximization
—The implementation of distributed network utility maximization (NUM) algorithms hinges heavily on information feedback through message passing among network elements. In practic...
Junshan Zhang, Dong Zheng, Mung Chiang
P2P
2007
IEEE
153views Communications» more  P2P 2007»
16 years 21 days ago
On Routing in Distributed Hash Tables
There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are ...
Fabius Klemm, Sarunas Girdzijauskas, Jean-Yves Le ...