Sciweavers

1798 search results - page 299 / 360
» A Tree for All Seasons
Sort
View
SODA
1996
ACM
95views Algorithms» more  SODA 1996»
13 years 9 months ago
RNC Algorithms for the Uniform Generation of Combinatorial Structures
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
AAAI
2008
13 years 8 months ago
Reasoning about Large Taxonomies of Actions
We design a representation based on the situation calculus to facilitate development, maintenance and elaboration of very large taxonomies of actions. This representation leads to...
Yilan Gu, Mikhail Soutchanski
CLEF
2010
Springer
13 years 8 months ago
ZOT! to Wikipedia Vandalism - Lab Report for PAN at CLEF 2010
Abstract This vandalism detector uses features primarily derived from a wordpreserving differencing of the text for each Wikipedia article from before and after the edit, along wit...
James White, Rebecca Maessen
CIBCB
2009
IEEE
13 years 8 months ago
Application of machine learning approaches on quantitative structure activity relationships
Machine Learning techniques are successfully applied to establish quantitative relations between chemical structure and biological activity (QSAR), i.e. classify compounds as activ...
Mariusz Butkiewicz, Ralf Mueller, Danilo Selic, Er...
ESA
2010
Springer
172views Algorithms» more  ESA 2010»
13 years 8 months ago
Algorithmic Meta-theorems for Restrictions of Treewidth
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
Michael Lampis