1225 search results - page 11 / 245 » The Instance Complexity Conjecture |
PPSN
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
ANTS
2006
Springer
13 years 11 months ago
2006
Springer
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
ICML
2001
IEEE
14 years 8 months ago
2001
IEEE
This paper introduces multiple instance regression, a variant of multiple regression in which each data point may be described by more than one vector of values for the independen...
NN
1998
Springer
13 years 7 months ago
1998
Springer
For complex database prediction problems such as medical diagnosis, the ARTMAP-IC neural network adds distributed prediction and category instance counting to the basic fuzzy ARTM...