Sciweavers

250 search results - page 45 / 50
» A Framework for Access Methods for Versioned Data
Sort
View
BMCBI
2010
161views more  BMCBI 2010»
13 years 8 months ago
CGHpower: exploring sample size calculations for chromosomal copy number experiments
Background: Determining a suitable sample size is an important step in the planning of microarray experiments. Increasing the number of arrays gives more statistical power, but ad...
Ilari Scheinin, Jose A. Ferreira, Sakari Knuutila,...
BMCBI
2007
123views more  BMCBI 2007»
13 years 7 months ago
BIRCH: A user-oriented, locally-customizable, bioinformatics system
Background: Molecular biologists need sophisticated analytical tools which often demand extensive computational resources. While finding, installing, and using these tools can be ...
Brian Fristensky
LICS
2007
IEEE
14 years 2 months ago
A computable approach to measure and integration theory
We introduce a computable framework for Lebesgue’s measure and integration theory in the spirit of domain theory. For an effectively given second countable locally compact Hausd...
Abbas Edalat
CIKM
2007
Springer
14 years 1 months ago
Regularized locality preserving indexing via spectral regression
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
Deng Cai, Xiaofei He, Wei Vivian Zhang, Jiawei Han
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 8 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang