Sciweavers

1424 search results - page 44 / 285
» The Multi-radius Cover Problem
Sort
View
81
Voted
DAM
2008
102views more  DAM 2008»
15 years 25 days ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
Jirí Fiala, Jan Kratochvíl, Attila P...
84
Voted
WEA
2005
Springer
100views Algorithms» more  WEA 2005»
15 years 6 months ago
Rounding to an Integral Program
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
Refael Hassin, Danny Segev
102
Voted
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
15 years 10 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
84
Voted
ICDE
2010
IEEE
193views Database» more  ICDE 2010»
15 years 7 months ago
Schema covering: a step towards enabling reuse in information integration
Abstract—We introduce schema covering, the problem of identifying easily understandable common objects for describing large and complex schemas. Defining transformations between...
Barna Saha, Ioana Stanoi, Kenneth L. Clarkson
LREC
2008
133views Education» more  LREC 2008»
15 years 2 months ago
Comparing Set-Covering Strategies for Optimal Corpus Design
This article is interested in the problem of the linguistic content of a speech corpus. Depending on the target task, the phonological and linguistic content of the corpus is cont...
Jonathan Chevelu, Nelly Barbot, Olivier Boëff...