Sciweavers

1806 search results - page 212 / 362
» Randomness and halting probabilities
Sort
View
ICPR
2004
IEEE
16 years 5 months ago
To FRAME or not to FRAME in Probabilistic Texture Modelling?
The maximum entropy principle is a cornerstone of FRAME (Filters, RAndom fields, and Maximum Entropy) model considered at times as a first-ever step towards a universal theory of ...
Georgy L. Gimel'farb, Luc J. Van Gool, Alexey Zale...
ICPR
2002
IEEE
16 years 5 months ago
Fractional Component Analysis (FCA) for Mixed Signals
This paper proposes the fractional component analysis (FCA), whose goal is to decompose the observed signal into component signals and recover their fractions. The uniqueness of o...
Asanobu Kitamoto
145
Voted
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
16 years 4 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
140
Voted
STOC
2003
ACM
140views Algorithms» more  STOC 2003»
16 years 4 months ago
Approximation schemes for clustering problems
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...
CVPR
2010
IEEE
15 years 11 months ago
Rapid Face Recognition Using Hashing
We propose a face recognition approach based on hashing. The approach yields comparable recognition rates with the random 1 approach [18], which is considered the stateof-the-art....
Qinfeng Shi, Hanxi Li, Chunhua Shen