1941 search results - page 210 / 389 » On the Hardness of Approximate Reasoning |
162
click to vote
JCO
2010
15 years 4 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...
167
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
Given a contact network that changes over time (say, day vs night connectivity), and the SIS (susceptible/infected/susceptible, flu like) virus propagation model, what can we say ...
212
click to vote
SPIRE
2010
Springer
15 years 4 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
201
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
271
click to vote
IGARSS
2010
15 years 1 months ago
2010
This paper investigates the performance of machine learning methods for classifying rock types from hyperspectral data. The main objective is to test the impact on classification ...