Sciweavers

5316 search results - page 885 / 1064
» Which Search Problems Are Random
Sort
View
BMCBI
2008
163views more  BMCBI 2008»
15 years 4 months ago
Gene Ontology term overlap as a measure of gene functional similarity
Background: The availability of various high-throughput experimental and computational methods allows biologists to rapidly infer functional relationships between genes. It is oft...
Meeta Mistry, Paul Pavlidis
IJAR
2006
125views more  IJAR 2006»
15 years 4 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
15 years 4 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 3 months ago
Broadcasting with an Energy Harvesting Rechargeable Transmitter
In this paper, we investigate the transmission completion time minimization problem in a two-user additive white Gaussian noise (AWGN) broadcast channel, where the transmitter is ...
Jing Yang, Omur Ozel, Sennur Ulukus
ECCV
2008
Springer
16 years 6 months ago
Compressive Sensing for Background Subtraction
Abstract. Compressive sensing (CS) is an emerging field that provides a framework for image recovery using sub-Nyquist sampling rates. The CS theory shows that a signal can be reco...
Volkan Cevher, Aswin C. Sankaranarayanan, Marco F....