Sciweavers

2721 search results - page 275 / 545
» An experimental analysis of Lemke-Howson algorithm
Sort
View
GLOBECOM
2007
IEEE
16 years 1 months ago
Clustered K-Center: Effective Replica Placement in Peer-to-Peer Systems
Abstract— Peer-to-Peer (P2P) systems provide decentralization, self-organization, scalability and failure-resilience, but suffer from high worst-case latencies. Researchers have ...
Jian Zhou, Xin Zhang, Laxmi N. Bhuyan, Bin Liu
IMC
2006
ACM
16 years 18 days ago
Shared-state sampling
We present an algorithm, Shared-State Sampling (S3 ), for the problem of detecting large flows in high-speed networks. While devised with different principles in mind, S3 turns ...
Frederic Raspall, Sebastià Sallent, Josep Y...
INFOCOM
2005
IEEE
16 years 7 days ago
Online time-constrained scheduling in linear networks
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
Joseph Naor, Adi Rosén, Gabriel Scalosub
ICIAR
2005
Springer
16 years 4 days ago
A Novel Tracking Framework Using Kalman Filtering and Elastic Matching
A novel region-based multiple object tracking framework based on Kalman filtering and elastic matching is proposed. The proposed Kalman filtering-elastic matching model is genera...
Xingzhi Luo, Suchendra M. Bhandarkar
PLDI
1994
ACM
15 years 10 months ago
The Program Structure Tree: Computing Control Regions in Linear Time
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
Richard Johnson, David Pearson, Keshav Pingali