7228 search results - page 247 / 1446 » From Algorithmic to Subjective Randomness |
140
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
128
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
This paper is focused on the Co-segmentation problem
[1] – where the objective is to segment a similar object from
a pair of images. The background in the two images may be
ar...
144
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Neighbor search is a fundamental task in machine learning, especially in classification and retrieval. Efficient nearest neighbor search methods have been widely studied, with the...
115
click to vote
SAT
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. On the theoreti...
128
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
Conditional Random Fields (CRFs) are often estimated using an entropy based criterion in combination with Generalized Iterative Scaling (GIS). GIS offers, upon others, the immedi...