Sciweavers

882 search results - page 144 / 177
» Local Search for Very Large SAT Problems
Sort
View
154
Voted
NIPS
2007
15 years 5 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
NIPS
2001
15 years 5 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi
151
Voted
BMCBI
2006
120views more  BMCBI 2006»
15 years 3 months ago
Projections for fast protein structure retrieval
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...
115
Voted
ASUNAM
2010
IEEE
15 years 5 months ago
Assessing Expertise Awareness in Resolution Networks
Problem resolution is a key issue in the IT service industry. A large service provider handles, on daily basis, thousands of tickets that report various types of problems from its...
Yi Chen, Shu Tao, Xifeng Yan, Nikos Anerousis, Qih...
150
Voted
WWW
2008
ACM
16 years 4 months ago
Finding the right facts in the crowd: factoid question answering over social media
Community Question Answering has emerged as a popular and effective paradigm for a wide range of information needs. For example, to find out an obscure piece of trivia, it is now ...
Jiang Bian, Yandong Liu, Eugene Agichtein, Hongyua...