Sciweavers

1074 search results - page 127 / 215
» An ASM-Characterization of a Class of Distributed Algorithms
Sort
View
ICML
2005
IEEE
16 years 4 months ago
A model for handling approximate, noisy or incomplete labeling in text classification
We introduce a Bayesian model, BayesANIL, that is capable of estimating uncertainties associated with the labeling process. Given a labeled or partially labeled training corpus of...
Ganesh Ramakrishnan, Krishna Prasad Chitrapura, Ra...
123
Voted
GLOBECOM
2008
IEEE
15 years 10 months ago
Routing with Probabilistic Delay Guarantees in Wireless Ad-Hoc Networks
—In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify...
Matthew Brand, Petar Maymounkov, Andreas F. Molisc...
COLT
2005
Springer
15 years 9 months ago
A PAC-Style Model for Learning from Labeled and Unlabeled Data
Abstract. There has been growing interest in practice in using unlabeled data together with labeled data in machine learning, and a number of different approaches have been develo...
Maria-Florina Balcan, Avrim Blum
114
Voted
IPPS
2000
IEEE
15 years 7 months ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen
132
Voted
TACAS
2000
Springer
138views Algorithms» more  TACAS 2000»
15 years 7 months ago
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent...
Luca de Alfaro, Marta Z. Kwiatkowska, Gethin Norma...