9842 search results - page 368 / 1969 » Problem complexity |
137
click to vote
NIPS
2003
15 years 8 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
152
click to vote
ICCS
2003
Springer
16 years 2 days ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
173
click to vote
SRDS
1997
IEEE
15 years 11 months ago
1997
IEEE
Hazard situations in safety-critical systems are typically complex, so there is a need for means to detect complex hazards and react in a timely and meaningful way. This paper add...
167
click to vote
PODS
2006
ACM
16 years 7 months ago
2006
ACM
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...
197
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...