Sciweavers

4208 search results - page 781 / 842
» Challenges in Evaluating Distributed Algorithms
Sort
View
ICC
2011
IEEE
237views Communications» more  ICC 2011»
12 years 8 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li
KDD
2012
ACM
217views Data Mining» more  KDD 2012»
11 years 11 months ago
Cross-domain collaboration recommendation
Interdisciplinary collaborations have generated huge impact to society. However, it is often hard for researchers to establish such cross-domain collaborations. What are the patte...
Jie Tang, Sen Wu, Jimeng Sun, Hang Su
ICML
2005
IEEE
14 years 10 months ago
Learning first-order probabilistic models with combining rules
Many real-world domains exhibit rich relational structure and stochasticity and motivate the development of models that combine predicate logic with probabilities. These models de...
Sriraam Natarajan, Prasad Tadepalli, Eric Altendor...
WWW
2008
ACM
14 years 10 months ago
Anycast CDNS revisited
Because it is an integral part of the Internet routing apparatus, and because it allows multiple instances of the same service to be "naturally" discovered, IP Anycast h...
Hussein A. Alzoubi, Seungjoon Lee, Michael Rabinov...
POPL
2009
ACM
14 years 10 months ago
Compositional shape analysis by means of bi-abduction
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...