Sciweavers

9949 search results - page 328 / 1990
» On the Network Complexity of Selection
Sort
View
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
16 years 7 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
CCIA
2007
Springer
16 years 29 days ago
Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques
With the arrival of high throughput genotyping techniques, the detection of likely genotyping errors is becoming an increasingly important problem. In this paper we are interested...
Martí Sánchez, Simon de Givry, Thoma...
BMCBI
2007
158views more  BMCBI 2007»
15 years 6 months ago
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
Corinne Dahinden, Giovanni Parmigiani, Mark C. Eme...
NN
2000
Springer
145views Neural Networks» more  NN 2000»
15 years 6 months ago
Best approximation by Heaviside perceptron networks
In Lp-spaces with p [1, ) there exists a best approximation mapping to the set of functions computable by Heaviside perceptron networks with n hidden units; however for p (1, ) ...
Paul C. Kainen, Vera Kurková, Andrew Vogt
JMLR
2006
85views more  JMLR 2006»
15 years 6 months ago
Streamwise Feature Selection
In streamwise feature selection, new features are sequentially considered for addition to a predictive model. When the space of potential features is large, streamwise feature sel...
Jing Zhou, Dean P. Foster, Robert A. Stine, Lyle H...