1046 search results - page 135 / 210 » Approximation Algorithms for Domination Search |
119
click to vote
IACR
2011
14 years 2 months ago
2011
Given a lattice L with the i-th successive minimum λi, its i-th gap λi λ1 often provides useful information for analyzing the security of cryptographic schemes related to L. The...
108
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
The process of development creates a phenotype from one or more genotypes of an individual through interaction with an environment. The opportunity for development to choose a phe...
132
click to vote
CRV
2005
IEEE
15 years 8 months ago
2005
IEEE
The extraction of optimal features, in a classification sense, is still quite challenging in the context of large-scale classification problems (such as visual recognition), inv...
143
Voted
MOBIHOC
2005
ACM
16 years 2 months ago
2005
ACM
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
115
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
In this work we propose a methodology for document reconstruction based on dynamic programming and a modified version of the Prim’s algorithm. Firstly, we use polygonal approxi...