Sciweavers

1316 search results - page 242 / 264
» Comparing mathematical models on the problem of network infe...
Sort
View
ICDCSW
2005
IEEE
15 years 7 months ago
Analysis and Algorithms for Content-Based Event Matching
    Content-based  event  matching  is  an  important  problem  in  large-scale  event-based  publish/subscribe  systems.  However,  open  questions  remain  in ...
Satyen Kale, Elad Hazan, Fengyun Cao, Jaswinder Pa...
INFOCOM
2010
IEEE
15 years 11 days ago
Two Samples are Enough: Opportunistic Flow-level Latency Estimation using NetFlow
—The inherent support in routers (SNMP counters or NetFlow) is not sufficient to diagnose performance problems in IP networks, especially for flow-specific problems where the ...
Myungjin Lee, Nick G. Duffield, Ramana Rao Kompell...
ICUMT
2009
14 years 11 months ago
A COP for cooperation in a P2P streaming protocol
This paper introduces a Combinatory Optimization Problem (COP) which captures the performance in cooperation of a P2P Streaming Network, considered at the buffer level. A new famil...
María Elisa Bertinat, Darío Padula, ...
BIBM
2008
IEEE
172views Bioinformatics» more  BIBM 2008»
15 years 8 months ago
Boosting Methods for Protein Fold Recognition: An Empirical Comparison
Protein fold recognition is the prediction of protein’s tertiary structure (Fold) given the protein’s sequence without relying on sequence similarity. Using machine learning t...
Yazhene Krishnaraj, Chandan K. Reddy
COMPULOG
1999
Springer
15 years 6 months ago
Decomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
Ian P. Gent, Kostas Stergiou, Toby Walsh