Sciweavers

2957 search results - page 217 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
SIP
2007
15 years 8 months ago
Contactless palmprint authentication using circular gabor filter and approximated string matching
More and more research have been developed very recently for automatic hand recognition. This paper proposes a new method for contactless hand authentication in complex images. Ou...
J. Doublet, O. Lepetit, M. Revenu
TCBB
2008
73views more  TCBB 2008»
15 years 6 months ago
Nature Reserve Selection Problem: A Tight Approximation Algorithm
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
Magnus Bordewich, Charles Semple
TCS
2008
15 years 6 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
15 years 4 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
DASFAA
2003
IEEE
115views Database» more  DASFAA 2003»
15 years 12 months ago
The BofS Solution to Limitations of Approximate Summaries
Data warehouses are of crucial importance to decision-making in competitive organizations. The fact that they store enormous quantities of data is a challenge in what concerns per...
Pedro Furtado, João Pedro Costa