Sciweavers

45 search results - page 8 / 9
» Exact Graph Coloring via Hybrid Approaches
Sort
View
ICWE
2010
Springer
13 years 4 months ago
Semantic Wonder Cloud: Exploratory Search in DBpedia
Inspired by the Google Wonder Wheel1 , in this paper we present Semantic Wonder Cloud (SWOC): a tool that helps users in knowledge exploration within the DBpedia dataset by adoptin...
Roberto Mirizzi, Azzurra Ragone, Tommaso Di Noia, ...
DAM
2007
107views more  DAM 2007»
13 years 5 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,...
ECCV
2010
Springer
13 years 10 months ago
From a Set of Shapes to Object Discovery
Abstract. This paper presents an approach to object discovery in a given unlabeled image set, based on mining repetitive spatial configurations of image contours. Contours that si...
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
13 years 11 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
ACTA
2007
92views more  ACTA 2007»
13 years 5 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider