14158 search results - page 371 / 2832 » Generalized switch-setting problems |
139
Voted
JCO
2010
15 years 3 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
151
click to vote
FIW
2009
15 years 2 months ago
2009
The security of software applications is an important domain, and one that mixes formalisms (e.g. when dealing with cryptography and security protocols) with very ad hoc, low level...
153
click to vote
JMLR
2010
14 years 11 months ago
2010
The problem of characterizing learnability is the most basic question of statistical learning theory. A fundamental and long-standing answer, at least for the case of supervised c...
253
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
206
Voted
GECCO
2011
Springer
14 years 8 months ago
2011
Springer
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...