2412 search results - page 140 / 483 » Which Problems Have Strongly Exponential Complexity |
156
click to vote
FOCS
1999
IEEE
15 years 7 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
141
click to vote
ACL
2006
15 years 4 months ago
2006
In this paper we report our work on building a POS tagger for a morphologically rich language- Hindi. The theme of the research is to vindicate the stand that- if morphology is st...
169
Voted
FGR
2011
IEEE
14 years 6 months ago
2011
IEEE
— In this work, we present novel warping algorithms for full 2D pixel-grid deformations for face recognition. Due to high variation in face appearance, face recognition is consid...
165
click to vote
SIAMCOMP
2012
13 years 5 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
127
Voted
ISNN
2009
Springer
15 years 10 months ago
2009
Springer
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...