903 search results - page 31 / 181 » On the reduction of a random basis |
112
click to vote
WEA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
113
click to vote
ACL
2008
15 years 3 months ago
2008
We propose a succinct randomized language model which employs a perfect hash function to encode fingerprints of n-grams and their associated probabilities, backoff weights, or oth...
146
click to vote
SAC
2006
ACM
15 years 7 months ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
111
click to vote
ICIP
2009
IEEE
16 years 3 months ago
2009
IEEE
Predicting the age of a person through face image analysis holds the potential to drive an extensive array of real world applications from human computer interaction and security ...
186
click to vote
CC
2010
Springer
14 years 8 months ago
2010
Springer
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...