Sciweavers

85 search results - page 10 / 17
» Scaling limit of random k-trees
Sort
View
BMCBI
2007
109views more  BMCBI 2007»
15 years 6 months ago
Computational RNA secondary structure design: empirical complexity and improved methods
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
Rosalía Aguirre-Hernández, Holger H....
CG
2006
Springer
15 years 6 months ago
Constrained diffusion-limited aggregation in 3 dimensions
Diffusion Limited Aggregation (DLA) has usually been studied in 2 dimensions as a model of fractal growth processes such as river networks, plant branching, frost on glass, electr...
Paul D. Bourke
WISEC
2010
ACM
15 years 11 months ago
Secret keys from entangled sensor motes: implementation and analysis
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
Matthias Wilhelm, Ivan Martinovic, Jens B. Schmitt
AAAI
2011
14 years 6 months ago
Logistic Methods for Resource Selection Functions and Presence-Only Species Distribution Models
In order to better protect and conserve biodiversity, ecologists use machine learning and statistics to understand how species respond to their environment and to predict how they...
Steven Phillips, Jane Elith
SIGIR
2006
ACM
16 years 12 days ago
Inferring document relevance via average precision
We consider the problem of evaluating retrieval systems using a limited number of relevance judgments. Recent work has demonstrated that one can accurately estimate average precis...
Javed A. Aslam, Emine Yilmaz