Sciweavers

310 search results - page 52 / 62
» Randomized Binary Search Trees
Sort
View
SPAA
1998
ACM
14 years 2 months ago
Fast Set Operations Using Treaps
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
Guy E. Blelloch, Margaret Reid-Miller
ACIVS
2006
Springer
14 years 1 months ago
Robust Analysis of Silhouettes by Morphological Size Distributions
We address the topic of real-time analysis and recognition of silhouettes. The method that we propose first produces object features obtained by a new type of morphological operato...
Olivier Barnich, Sébastien Jodogne, Marc Va...
NIPS
2007
13 years 11 months ago
Loop Series and Bethe Variational Bounds in Attractive Graphical Models
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
Erik B. Sudderth, Martin J. Wainwright, Alan S. Wi...
BMCBI
2010
164views more  BMCBI 2010»
13 years 10 months ago
Pan-genome sequence analysis using Panseq: an online tool for the rapid analysis of core and accessory genomic regions
Background: The pan-genome of a bacterial species consists of a core and an accessory gene pool. The accessory genome is thought to be an important source of genetic variability i...
Chad Laing, Cody Buchanan, Eduardo N. Taboada, Yon...
ECML
2006
Springer
14 years 1 months ago
Improving Control-Knowledge Acquisition for Planning by Active Learning
Automatically acquiring control-knowledge for planning, as it is the case for Machine Learning in general, strongly depends on the training examples. In the case of planning, examp...
Raquel Fuentetaja, Daniel Borrajo