Sciweavers

2681 search results - page 443 / 537
» Problem F
Sort
View
ECCC
2010
117views more  ECCC 2010»
13 years 8 months ago
Nearly Tight Bounds for Testing Function Isomorphism
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
Sourav Chakraborty, David García-Soriano, A...
IJON
1998
172views more  IJON 1998»
13 years 9 months ago
Blind separation of convolved mixtures in the frequency domain
In this paper we employ information theoretic algorithms, previously used for separating instantaneous mixtures of sources, for separating convolved mixtures in the frequency doma...
Paris Smaragdis
BMCBI
2006
172views more  BMCBI 2006»
13 years 10 months ago
BioWarehouse: a bioinformatics database warehouse toolkit
Background: This article addresses the problem of interoperation of heterogeneous bioinformatics databases. Results: We introduce BioWarehouse, an open source toolkit for construc...
Thomas J. Lee, Yannick Pouliot, Valerie Wagner, Pr...
ICCV
2007
IEEE
15 years 2 days ago
Supervised Learning of Image Restoration with Convolutional Networks
Convolutional networks have achieved a great deal of success in high-level vision problems such as object recognition. Here we show that they can also be used as a general method ...
Viren Jain, Joseph F. Murray, Fabian Roth, Sriniva...
ECCV
2008
Springer
15 years 6 hour 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....