5153 search results - page 194 / 1031 » Introduction to Randomized Algorithms |
122
click to vote
ECCC
2010
15 years 16 days ago
2010
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...
157
Voted
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
This paper presents a dynamic conditional random field (DCRF) model to integrate contextual constraints for object segmentation in image sequences. Spatial and temporal dependenci...
138
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
150
click to vote
CSCLP
2005
Springer
15 years 8 months ago
2005
Springer
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
126
click to vote
CP
2000
Springer
15 years 6 months ago
2000
Springer
This paper addresses the interaction between randomization, with restart strategies, and learning, an often crucial technique for proving unsatisfiability. We use instances of SAT ...