Sciweavers

4940 search results - page 979 / 988
» On the Complexity of Universal Programs
Sort
View
NAR
2007
62views more  NAR 2007»
13 years 9 months ago
MolProbity: all-atom contacts and structure validation for proteins and nucleic acids
MolProbity is a general-purpose web server offering quality validation for 3D structures of proteins, nucleic acids and complexes. It provides detailed all-atom contact analysis o...
Ian W. Davis, Andrew Leaver-Fay, Vincent B. Chen, ...
PERCOM
2007
ACM
13 years 9 months ago
An application adaptation layer for wireless sensor networks
In wireless sensor networks, poor performance or unexpected behavior may be experienced for several reasons, such as trivial deterioration of sensing hardware, unsatisfactory impl...
Marco Avvenuti, Paolo Corsini, Paolo Masci, Alessi...
PVLDB
2008
182views more  PVLDB 2008»
13 years 9 months ago
SCOPE: easy and efficient parallel processing of massive data sets
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
Ronnie Chaiken, Bob Jenkins, Per-Åke Larson,...
SCFBM
2008
107views more  SCFBM 2008»
13 years 9 months ago
Microbial Diagnostic Array Workstation (MDAW): a web server for diagnostic array data storage, sharing and analysis
Background: Microarrays are becoming a very popular tool for microbial detection and diagnostics. Although these diagnostic arrays are much simpler when compared to the traditiona...
Joy Scaria, Aswathy Sreedharan, Yung-Fu Chang
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 8 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna