973 search results - page 71 / 195 » New Bounds on Crossing Numbers |
ANTS
1994
Springer
15 years 4 months ago
1994
Springer
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
ICCAD
1997
IEEE
15 years 4 months ago
1997
IEEE
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...
101
click to vote
AAECC
2005
Springer
14 years 11 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
135
click to vote
ICNP
2009
IEEE
14 years 9 months ago
2009
IEEE
Sensor networks deployed in hostile areas are subject to node replication attacks, in which an adversary compromises a few sensors, extracts the security keys, and clones them in a...
144
click to vote
JMLR
2012
13 years 2 months ago
2012
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...