683 search results - page 35 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
ICCSA
2004
Springer
14 years 1 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
PAMI
2010
13 years 6 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
PAKDD
1998
ACM
14 years 21 hour ago
1998
ACM
Abstract. Approaches to data mining proposed so far are mainly symbolic decision trees and numerical feedforward neural networks methods. While decision trees give, in many cases, ...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
Context modeling for Vision Recognition and Automatic Image Annotation (AIA) has attracted increasing attentions in recent years. For various contextual information and resources,...
SWAT
1994
Springer
13 years 12 months ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...