Sciweavers

15073 search results - page 440 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
BMCBI
2007
219views more  BMCBI 2007»
15 years 7 months ago
MetaQTL: a package of new computational methods for the meta-analysis of QTL mapping experiments
Background: Integration of multiple results from Quantitative Trait Loci (QTL) studies is a key point to understand the genetic determinism of complex traits. Up to now many effor...
Jean-Baptiste Veyrieras, Bruno Goffinet, Alain Cha...
APGV
2010
ACM
266views Visualization» more  APGV 2010»
15 years 11 months ago
Horizon estimation: perceptual and computational experiments
The human visual system is able to quickly and robustly infer a wealth of scene information – the scene "gist" – already after 100 milliseconds of image presentation...
Christian Herdtweck, Christian Wallraven
211
Voted
FOCS
2008
IEEE
16 years 1 months ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan
BMCBI
2004
154views more  BMCBI 2004»
15 years 7 months ago
Computation of elementary modes: a unifying framework and the new binary approach
Background: Metabolic pathway analysis has been recognized as a central approach to the structural analysis of metabolic networks. The concept of elementary (flux) modes provides ...
Julien Gagneur, Steffen Klamt
372
Voted
ICDE
2009
IEEE
171views Database» more  ICDE 2009»
16 years 9 months ago
A Framework for Clustering Massive-Domain Data Streams
In this paper, we will examine the problem of clustering massive domain data streams. Massive-domain data streams are those in which the number of possible domain values for each a...
Charu C. Aggarwal