Sciweavers

20197 search results - page 3651 / 4040
» Comparing Computational Power
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 2 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
QEST
2010
IEEE
15 years 2 months ago
Fortuna: Model Checking Priced Probabilistic Timed Automata
We introduce Fortuna, the first tool for model checking priced probabilistic timed automata (PPTAs). Fortuna can handle the combination of real-time, probabilistic and cost feature...
Jasper Berendsen, David N. Jansen, Frits W. Vaandr...
SIGDIAL
2010
15 years 2 months ago
Discourse indicators for content selection in summarization
We present analyses aimed at eliciting which specific aspects of discourse provide the strongest indication for text importance. In the context of content selection for single doc...
Annie Louis, Aravind K. Joshi, Ani Nenkova
TMA
2010
Springer
183views Management» more  TMA 2010»
15 years 2 months ago
Kiss to Abacus: A Comparison of P2P-TV Traffic Classifiers
In the last few years the research community has proposed several techniques for network traffic classification. While the performance of these methods is promising especially for ...
Alessandro Finamore, Michela Meo, Dario Rossi, Sil...
USS
2010
15 years 2 months ago
VEX: Vetting Browser Extensions for Security Vulnerabilities
The browser has become the de facto platform for everyday computation. Among the many potential attacks that target or exploit browsers, vulnerabilities in browser extensions have...
Sruthi Bandhakavi, Samuel T. King, P. Madhusudan, ...
« Prev « First page 3651 / 4040 Last » Next »