Sciweavers

385 search results - page 50 / 77
» Probabilistic ranking over relations
Sort
View
WWW
2007
ACM
14 years 8 months ago
Extraction and search of chemical formulae in text documents on the web
Often scientists seek to search for articles on the Web related to a particular chemical. When a scientist searches for a chemical formula using a search engine today, she gets ar...
Bingjun Sun, Qingzhao Tan, Prasenjit Mitra, C. Lee...
CSL
2007
Springer
13 years 7 months ago
Soft indexing of speech content for search in spoken documents
The paper presents the Position Specific Posterior Lattice (PSPL), a novel lossy representation of automatic speech recognition lattices that naturally lends itself to efficient ...
Ciprian Chelba, Jorge Silva, Alex Acero
DEBU
1998
95views more  DEBU 1998»
13 years 7 months ago
What can you do with a Web in your Pocket?
The amount of information available online has grown enormously over the past decade. Fortunately, computing power, disk capacity, and network bandwidth have also increased dramat...
Sergey Brin, Rajeev Motwani, Lawrence Page, Terry ...
DAM
2010
137views more  DAM 2010»
13 years 7 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
AAAI
2010
13 years 5 months ago
A Topic Model for Linked Documents and Update Rules for its Estimation
The latent topic model plays an important role in the unsupervised learning from a corpus, which provides a probabilistic interpretation of the corpus in terms of the latent topic...
Zhen Guo, Shenghuo Zhu, Zhongfei Zhang, Yun Chi, Y...