Sciweavers

79 search results - page 16 / 16
» A Basic Characterization of Relation Migration
Sort
View
DAM
2007
107views more  DAM 2007»
13 years 7 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
ML
2010
ACM
127views Machine Learning» more  ML 2010»
13 years 5 months ago
Stability and model selection in k-means clustering
Abstract Clustering Stability methods are a family of widely used model selection techniques for data clustering. Their unifying theme is that an appropriate model should result in...
Ohad Shamir, Naftali Tishby
TCS
2010
13 years 5 months ago
Invariant games
In the context of 2-player removal games, we define the notion of invariant game for which each allowed move is independent of the position it is played from. We present a family ...
Éric Duchêne, Michel Rigo
BMCBI
2011
13 years 2 months ago
Worm Phenotype Ontology: integrating phenotype data within and beyond the C. elegans community
Background: Caenorhabditis elegans gene-based phenotype information dates back to the 1970’s, beginning with Sydney Brenner and the characterization of behavioral and morphologi...
Gary Schindelman, Jolene Fernandes, Carol Bastiani...