1941 search results - page 250 / 389 » On the Hardness of Approximate Reasoning |
196
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: While multiple alignment is the first step of usual classification schemes for biological sequences, alignment-free methods are being increasingly used as alternatives...
150
click to vote
IGPL
2008
15 years 5 months ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
203
click to vote
SENSYS
2010
ACM
15 years 4 months ago
2010
ACM
Many participatory sensing applications use data collected by participants to construct a public model of a system or phenomenon. For example, a health application might compute a...
206
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...
171
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...