Sciweavers

12194 search results - page 2295 / 2439
» cans 2010
Sort
View
RECOMB
2010
Springer
15 years 8 months ago
naiveBayesCall: An Efficient Model-Based Base-Calling Algorithm for High-Throughput Sequencing
Immense amounts of raw instrument data (i.e., images of fluorescence) are currently being generated using ultra high-throughput sequencing platforms. An important computational cha...
Wei-Chun Kao, Yun S. Song
ADBIS
2010
Springer
192views Database» more  ADBIS 2010»
15 years 8 months ago
The Objects Interaction Graticule for Cardinal Direction Querying in Moving Objects Data Warehouses
Cardinal directions have turned out to be very important qualitative spatial relations due to their numerous applications in spatial wayfinding, GIS, qualitative spatial reasoning ...
Ganesh Viswanathan, Markus Schneider
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
15 years 8 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
APPROX
2010
Springer
193views Algorithms» more  APPROX 2010»
15 years 8 months ago
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
MohammadHossein Bateni, Julia Chuzhoy
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
15 years 8 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
« Prev « First page 2295 / 2439 Last » Next »