Sciweavers

849 search results - page 57 / 170
» Study of Challenges and Techniques in Large Scale Matching
Sort
View
86
Voted
JSAC
2007
59views more  JSAC 2007»
15 years 12 days ago
On scheduling of peer-to-peer video services
Abstract— Peer-to-peer (P2P) video systems provide a costeffective way for a large number of hosts to colloaborate for video sharing. Two features characterize such a system: 1) ...
Ying Cai, Ashwin Natarajan, Johnny Wong
CIKM
2009
Springer
15 years 7 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
ISPD
2003
ACM
121views Hardware» more  ISPD 2003»
15 years 5 months ago
Optimality, scalability and stability study of partitioning and placement algorithms
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
Jason Cong, Michail Romesis, Min Xie
88
Voted
SARA
2007
Springer
15 years 6 months ago
Homogeneous Hierarchical Composition of Areas in Multi-robot Area Coverage
Multi-robot area coverage poses several research challenges. The challenge of coordinating multiple robots’ actions coupled with the challenge of minimizing the overlap in covera...
Sriram Raghavan, Ravindran B
95
Voted
ICS
2004
Tsinghua U.
15 years 5 months ago
Scaling the issue window with look-ahead latency prediction
In contemporary out-of-order superscalar design, high IPC is mainly achieved by exposing high instruction level parallelism (ILP). Scaling issue window size can certainly provide ...
Yongxiang Liu, Anahita Shayesteh, Gokhan Memik, Gl...