Sciweavers

1187 search results - page 228 / 238
» Unsupervised Natural Language Processing Using Graph Models
Sort
View
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
11 years 10 months ago
Local structure and determinism in probabilistic databases
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
Theodoros Rekatsinas, Amol Deshpande, Lise Getoor
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 3 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
ANLP
1994
108views more  ANLP 1994»
13 years 9 months ago
Does Baum-Welch Re-estimation Help Taggers?
In part of speech tagging by Hidden Markov Model, a statistical model is used to assign grammatical categories to words in a text. Early work in the field relied on a corpus which...
David Elworthy
ICDE
2007
IEEE
138views Database» more  ICDE 2007»
14 years 9 months ago
Representing and Querying Correlated Tuples in Probabilistic Databases
Probabilistic databases have received considerable attention recently due to the need for storing uncertain data produced by many real world applications. The widespread use of pr...
Prithviraj Sen, Amol Deshpande
ICALP
2009
Springer
14 years 8 months ago
Annotations in Data Streams
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
Amit Chakrabarti, Graham Cormode, Andrew McGregor