Sciweavers

57 search results - page 11 / 12
» A new approach to the planted clique problem
Sort
View
AAAI
2006
13 years 8 months ago
DNNF-based Belief State Estimation
As embedded systems grow increasingly complex, there is a pressing need for diagnosing and monitoring capabilities that estimate the system state robustly. This paper is based on ...
Paul Elliott, Brian C. Williams
ECCC
2007
122views more  ECCC 2007»
13 years 7 months ago
Infeasibility of Instance Compression and Succinct PCPs for NP
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
Lance Fortnow, Rahul Santhanam
IV
2008
IEEE
296views Visualization» more  IV 2008»
14 years 1 months ago
Revealing Subnetwork Roles using Contextual Visualization: Comparison of Metabolic Networks
This article is addressing a recurrent problem in biology: mining newly built large scale networks. Our approach consists in comparing these new networks to well known ones. The v...
Romain Bourqui, Fabien Jourdan
DASFAA
2003
IEEE
108views Database» more  DASFAA 2003»
14 years 22 days ago
Spatial Query Processing for High Resolutions
Modern database applications including computeraided design (CAD), medical imaging, or molecular biology impose new requirements on spatial query processing. Particular problems a...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
DAGSTUHL
2009
13 years 8 months ago
Learning Highly Structured Manifolds: Harnessing the Power of SOMs
Abstract. In this paper we elaborate on the challenges of learning manifolds that have many relevant clusters, and where the clusters can have widely varying statistics. We call su...
Erzsébet Merényi, Kadim Tasdemir, Li...