Sciweavers

862 search results - page 160 / 173
» Random Information Spread in Networks
Sort
View
TON
2010
136views more  TON 2010»
13 years 2 months ago
Distributed Opportunistic Scheduling With Two-Level Probing
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
P. S. Chandrashekhar Thejaswi, Junshan Zhang, Man-...
SIGSOFT
2008
ACM
14 years 8 months ago
Deriving input syntactic structure from execution
Program input syntactic structure is essential for a wide range of applications such as test case generation, software debugging and network security. However, such important info...
Zhiqiang Lin, Xiangyu Zhang
IWANN
2009
Springer
14 years 2 months ago
Identification of Chemical Entities in Patent Documents
Biomedical literature is an important source of information for chemical compounds. However, different representations and nomenclatures for chemical entities exist, which makes th...
Tiago Grego, Piotr Pezik, Francisco M. Couto, Diet...
ICDM
2005
IEEE
190views Data Mining» more  ICDM 2005»
14 years 1 months ago
Neighborhood Formation and Anomaly Detection in Bipartite Graphs
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors ...
Jimeng Sun, Huiming Qu, Deepayan Chakrabarti, Chri...
WOSP
2005
ACM
14 years 29 days ago
Performance characterization of decentralized algorithms for replica selection in distributed object systems
Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a ...
Ceryen Tan, Kevin Mills