Sciweavers

1921 search results - page 251 / 385
» Making AC-3 an Optimal Algorithm
Sort
View
136
Voted
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
16 years 2 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
109
Voted
SIGMOD
2004
ACM
100views Database» more  SIGMOD 2004»
16 years 2 months ago
Cost-Based Labeling of Groups of Mass Spectra
We make two main contributions in this paper. First, we motivate and introduce a novel class of data mining problems that arise in labeling a group of mass spectra, specifically f...
Lei Chen 0003, Zheng Huang, Raghu Ramakrishnan
131
Voted
CVPR
2010
IEEE
15 years 11 months ago
Surface Extraction from Binary Volumes with Higher-Order Smoothness
A number of 3D shape reconstruction algorithms, in particular 3D image segmentation methods, produce their results in the form of binary volumes, where a binary value indicates whe...
Victor Lempitsky
100
Voted
ECSQARU
2009
Springer
15 years 9 months ago
Local Computation Schemes with Partially Ordered Preferences
Many computational problems linked to reasoning under uncertainty can be expressed in terms of computing the marginal(s) of the combination of a collection of (local) valuation fun...
Hélène Fargier, Nic Wilson
149
Voted
ICASSP
2007
IEEE
15 years 9 months ago
Markov Random Field Energy Minimization via Iterated Cross Entropy with Partition Strategy
This paper introduces a novel energy minimization method, namely iterated cross entropy with partition strategy (ICEPS), into the Markov random field theory. The solver, which is...
Jue Wu, Albert C. S. Chung