Sciweavers

3946 search results - page 629 / 790
» The computational complexity of choice sets
Sort
View
RECOMB
2006
Springer
16 years 6 months ago
Genome-Wide Discovery of Modulators of Transcriptional Interactions in Human B Lymphocytes
Abstract. Transcriptional interactions in a cell are modulated by a variety of mechanisms that prevent their representation as pure pairwise interactions between a transcription fa...
Kai Wang, Ilya Nemenman, Nilanjana Banerjee, Adam ...
GRAPHITE
2005
ACM
16 years 3 days ago
3D screen-space widgets for non-linear projection
Linear perspective is a good approximation to the format in which the human visual system conveys 3D scene information to the brain. Artists expressing 3D scenes, however, create ...
Patrick Coleman, Karan Singh, Leon Barrett, Nisha ...
CLOUD
2010
ACM
15 years 11 months ago
Stateful bulk processing for incremental analytics
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...
Dionysios Logothetis, Christopher Olston, Benjamin...
NIPS
1997
15 years 8 months ago
EM Algorithms for PCA and SPCA
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...
Sam T. Roweis
FSTTCS
2008
Springer
15 years 7 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel