Sciweavers

7228 search results - page 886 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
DAGSTUHL
2007
15 years 8 months ago
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
Bodo Manthey, Till Tantau
AI
2010
Springer
15 years 7 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
BMCBI
2010
193views more  BMCBI 2010»
15 years 7 months ago
MZmine 2: Modular framework for processing, visualizing, and analyzing mass spectrometry-based molecular profile data
Background: Mass spectrometry (MS) coupled with online separation methods is commonly applied for differential and quantitative profiling of biological samples in metabolomic as w...
Tomás Pluskal, Sandra Castillo, Alejandro V...
BMCBI
2007
134views more  BMCBI 2007»
15 years 7 months ago
Nearest Neighbor Networks: clustering expression data based on gene neighborhoods
Background: The availability of microarrays measuring thousands of genes simultaneously across hundreds of biological conditions represents an opportunity to understand both indiv...
Curtis Huttenhower, Avi I. Flamholz, Jessica N. La...
CORR
2010
Springer
170views Education» more  CORR 2010»
15 years 7 months ago
Sidelobe Control in Collaborative Beamforming via Node Selection
Collaborative beamforming (CB) is a power efficient method for data communications in wireless sensor networks (WSNs) which aims at increasing the transmission range in the network...
Mohammed F. A. Ahmed, Sergiy A. Vorobyov