4047 search results - page 157 / 810 » The Discrete Basis Problem |
89
Voted
PAMI
1998
15 years 14 days ago
1998
—In this paper, we give a detailed analysis of the accuracy of Zernike moments in terms of their discretization errors and the reconstruction power. It is found that there is an ...
153
Voted
STOC
1999
ACM
15 years 5 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
CP
2003
Springer
15 years 6 months ago
2003
Springer
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
AAAI
2004
15 years 2 months ago
2004
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
107
Voted
ICIP
2007
IEEE
16 years 2 months ago
2007
IEEE
In this paper, we discuss the application of the two-dimensio- nal paired representation for processing medical images. This representation leads to the effective solution of the ...