Sciweavers

5606 search results - page 236 / 1122
» Randomization Techniques for Graphs.
Sort
View
CVPR
2010
IEEE
15 years 6 months ago
Semantic Context Modeling with Maximal Margin Conditional Random Fields for Automatic Image Annotation
Context modeling for Vision Recognition and Automatic Image Annotation (AIA) has attracted increasing attentions in recent years. For various contextual information and resources,...
Yu Xiang, Xiangdong Zhou, Zuotao Liu, Tat-seng chu...
132
Voted
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 5 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
BMCBI
2007
160views more  BMCBI 2007»
15 years 29 days ago
Identifying protein complexes directly from high-throughput TAP data with Markov random fields
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
Wasinee Rungsarityotin, Roland Krause, Arno Sch&ou...
115
Voted
DKE
2007
130views more  DKE 2007»
15 years 24 days ago
Enabling access-privacy for random walk based data analysis applications
Random walk graph and Markov chain based models are used heavily in many data and system analysis domains, including web, bioinformatics, and queuing. These models enable the desc...
Ping Lin, K. Selçuk Candan
118
Voted
PAMI
2008
198views more  PAMI 2008»
15 years 23 days ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...