Sciweavers

782 search results - page 47 / 157
» Graph Clustering for Keyword Search
Sort
View
SIGIR
2005
ACM
14 years 1 months ago
Relation between PLSA and NMF and implications
Non-negative Matrix Factorization (NMF, [5]) and Probabilistic Latent Semantic Analysis (PLSA, [4]) have been successfully applied to a number of text analysis tasks such as docum...
Éric Gaussier, Cyril Goutte
VLDB
1998
ACM
144views Database» more  VLDB 1998»
14 years 5 days ago
Proximity Search in Databases
An information retrieval IR engine can rank documents based on textual proximityof keywords within each document. In this paper we apply this notion to search across an entire dat...
Roy Goldman, Narayanan Shivakumar, Suresh Venkatas...
IAT
2009
IEEE
13 years 12 months ago
Efficient Distributed Bayesian Reasoning via Targeted Instantiation of Variables
Abstract--This paper is focusing on exact Bayesian reasoning in systems of agents, which represent weakly coupled processing modules supporting collaborative inference through mess...
Patrick de Oude, Gregor Pavlin
WWW
2005
ACM
14 years 8 months ago
Scaling link-based similarity search
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
Balázs Rácz, Dániel Fogaras
MST
2010
107views more  MST 2010»
13 years 6 months ago
Fixed-Parameter Algorithms for Cluster Vertex Deletion
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
Falk Hüffner, Christian Komusiewicz, Hannes M...