Sciweavers

1512 search results - page 119 / 303
» Inference Algorithms for Similarity Networks
Sort
View
INFOSCALE
2007
ACM
15 years 4 months ago
A distributed incremental nearest neighbor algorithm
Searching for non-text data (e.g., images) is mostly done by means of metadata annotations or by extracting the text close to the data. However, supporting real content-based audi...
Fabrizio Falchi, Claudio Gennaro, Fausto Rabitti, ...
CORR
2012
Springer
210views Education» more  CORR 2012»
13 years 10 months ago
Fast MCMC sampling for Markov jump processes and continuous time Bayesian networks
Markov jump processes and continuous time Bayesian networks are important classes of continuous time dynamical systems. In this paper, we tackle the problem of inferring unobserve...
Vinayak Rao, Yee Whye Teh
ICDE
2006
IEEE
162views Database» more  ICDE 2006»
16 years 4 months ago
Efficient Batch Top-k Search for Dictionary-based Entity Recognition
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...
Amit Chandel, P. C. Nagesh, Sunita Sarawagi
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 5 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
BCB
2010
213views Bioinformatics» more  BCB 2010»
14 years 10 months ago
Markov clustering of protein interaction networks with improved balance and scalability
Markov Clustering (MCL) is a popular algorithm for clustering networks in bioinformatics such as protein-protein interaction networks and protein similarity networks. An important...
Venu Satuluri, Srinivasan Parthasarathy, Duygu Uca...