Sciweavers

851 search results - page 95 / 171
» Random constructions and density results
Sort
View
BMCBI
2007
138views more  BMCBI 2007»
14 years 10 months ago
A novel Bayesian approach to quantify clinical variables and to determine their spectroscopic counterparts in 1H NMR metabonomic
Background: A key challenge in metabonomics is to uncover quantitative associations between multidimensional spectroscopic data and biochemical measures used for disease risk asse...
Aki Vehtari, Ville-Petteri Mäkinen, Pasi Soin...
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
14 years 10 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
TIT
2002
63views more  TIT 2002»
14 years 9 months ago
Structured unitary space-time autocoding constellations
We recently showed that arbitrarily reliable communication is possible within a single coherence interval in Rayleigh flat fading as the symbol-duration of the coherence interval ...
Thomas L. Marzetta, Babak Hassibi, Bertrand M. Hoc...
76
Voted
CRYPTO
2001
Springer
125views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
Robust Non-interactive Zero Knowledge
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
Alfredo De Santis, Giovanni Di Crescenzo, Rafail O...
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
15 years 4 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl