Sciweavers

310 search results - page 45 / 62
» Randomized Binary Search Trees
Sort
View
PODC
2011
ACM
13 years 22 days ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 4 months ago
Evolutionary algorithms and matroid optimization problems
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Joachim Reichel, Martin Skutella
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
14 years 4 months ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia
BMCBI
2010
118views more  BMCBI 2010»
13 years 10 months ago
From learning taxonomies to phylogenetic learning: Integration of 16S rRNA gene data into FAME-based bacterial classification
Background: Machine learning techniques have shown to improve bacterial species classification based on fatty acid methyl ester (FAME) data. Nonetheless, FAME analysis has a limit...
Bram Slabbinck, Willem Waegeman, Peter Dawyndt, Pa...
WWW
2008
ACM
14 years 10 months ago
Mining, indexing, and searching for textual chemical molecule information on the web
Current search engines do not support user searches for chemical entities (chemical names and formulae) beyond simple keyword searches. Usually a chemical molecule can be represen...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles