10054 search results - page 455 / 2011 » On the Complexity of Function Learning |
152
Voted
DAC
2008
ACM
16 years 6 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
153
click to vote
BMCBI
2007
15 years 5 months ago
2007
Background: Phylogenetic profiles record the occurrence of homologs of genes across fully sequenced organisms. Proteins with similar profiles are typically components of protein c...
153
click to vote
BMCBI
2005
15 years 4 months ago
2005
Background: The availability of interaction databases provides an opportunity for researchers to utilize immense amounts of data exclusively in silico. Recently there has been an ...
183
click to vote
TIT
2010
14 years 11 months ago
2010
The plenoptic function (Adelson and Bergen, 91) describes the visual information available to an observer at any point in space and time. Samples of the plenoptic function (POF) a...
193
click to vote
MICCAI
2009
Springer
16 years 5 months ago
2009
Springer
Compared with Diffusion Tensor Imaging (DTI), High Angular Resolution Imaging (HARDI) can better explore the complex microstructure of white matter. Orientation Distribution Functi...