Sciweavers

2354 search results - page 471 / 471
» Randomness, Stochasticity and Approximations
Sort
View
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
14 years 6 months ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen
SAGA
2007
Springer
14 years 13 days ago
Probabilistic Techniques in Algorithmic Game Theory
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
Spyros C. Kontogiannis, Paul G. Spirakis
CCS
2006
ACM
13 years 10 months ago
EXE: automatically generating inputs of death
This paper presents EXE, an effective bug-finding tool that automatically generates inputs that crash real code. Instead of running code on manually or randomly constructed input,...
Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, ...
PRIB
2010
Springer
242views Bioinformatics» more  PRIB 2010»
13 years 4 months ago
Consensus of Ambiguity: Theory and Application of Active Learning for Biomedical Image Analysis
Abstract. Supervised classifiers require manually labeled training samples to classify unlabeled objects. Active Learning (AL) can be used to selectively label only “ambiguous...
Scott Doyle, Anant Madabhushi