Sciweavers

74 search results - page 5 / 15
» Finding Large Independent Sets in Polynomial Expected Time
Sort
View
EMNLP
2008
13 years 9 months ago
A comparison of Bayesian estimators for unsupervised Hidden Markov Model POS taggers
There is growing interest in applying Bayesian techniques to NLP problems. There are a number of different estimators for Bayesian models, and it is useful to know what kinds of t...
Jianfeng Gao, Mark Johnson
EDBT
2011
ACM
231views Database» more  EDBT 2011»
12 years 11 months ago
Data integration with dependent sources
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
Anish Das Sarma, Xin Luna Dong, Alon Y. Halevy
JMLR
2010
115views more  JMLR 2010»
13 years 2 months ago
Bayesian structure discovery in Bayesian networks with less space
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
Pekka Parviainen, Mikko Koivisto
ALT
1997
Springer
13 years 11 months ago
Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries
A pattern is a string of constant and variable symbols. The language generated by a pattern is the set of all strings of constant symbols which can be obtained from by substituti...
Thomas Erlebach, Peter Rossmanith, Hans Stadtherr,...
CG
2008
Springer
13 years 7 months ago
Masked photo blending: Mapping dense photographic data set on high-resolution sampled 3D models
The technological advance of sensors is producing an exponential size growth of the data coming from 3D scanning and digital photography. The production of digital 3D models consi...
Marco Callieri, Paolo Cignoni, Massimiliano Corsin...