Sciweavers

4377 search results - page 112 / 876
» Mass problems and randomness
Sort
View
185
Voted
CPHYSICS
2011
271views Education» more  CPHYSICS 2011»
14 years 9 months ago
A dedicated algorithm for calculating ground states for the triangular random bond Ising model
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
O. Melchert, A. K. Hartmann
ICML
2006
IEEE
16 years 6 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
15 years 5 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
PAMI
2010
249views more  PAMI 2010»
15 years 4 months ago
Fast Keypoint Recognition Using Random Ferns
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
Mustafa Özuysal, Michael Calonder, Vincent Le...
EMNLP
2010
15 years 3 months ago
Word Sense Induction Disambiguation Using Hierarchical Random Graphs
Graph-based methods have gained attention in many areas of Natural Language Processing (NLP) including Word Sense Disambiguation (WSD), text summarization, keyword extraction and ...
Ioannis P. Klapaftis, Suresh Manandhar