15033 search results - page 292 / 3007 » Complexity Theory and Algorithms |
142
click to vote
ICDM
2007
IEEE
15 years 11 months ago
2007
IEEE
Most algorithms for mining interesting spatial colocations integrate the co-location / clique generation task with the interesting pattern mining task, and are usually based on th...
174
click to vote
STOC
2012
ACM
13 years 7 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
144
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
135
click to vote
MICCAI
2004
Springer
16 years 5 months ago
2004
Springer
Abstract. Often in neurosurgical planning a dual spin echo acquisition is performed that yields proton density (PD) and T2-weighted images to evaluate edema near a tumor or lesion....
159
Voted
ICCV
1995
IEEE
15 years 8 months ago
1995
IEEE
Computational vision algorithms are often developed in a Bayesian framework. Two estimators are commonly used: maximum a posteriori (MAP), and minimum mean squared error (MMSE). W...