Sciweavers

16404 search results - page 709 / 3281
» A set coverage problem
Sort
View
ECAI
2010
Springer
15 years 8 months ago
Majority Merging: from Boolean Spaces to Affine Spaces
Abstract. This paper is centered on the problem of merging (possibly conflicting) information coming from different sources. Though this problem has attracted much attention in pro...
Jean-François Condotta, Souhila Kaci, Pierr...
196
Voted
CORR
2006
Springer
164views Education» more  CORR 2006»
15 years 7 months ago
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey
IPL
2011
73views more  IPL 2011»
15 years 2 months ago
Maximum subset intersection
Consider the following problem. Given n sets of sets A1, . . . , Au with elements over a universe E = {e1, . . . , en}, the goal is to select exactly one set from each of A1, . . ...
Raphaël Clifford, Alexandru Popa
ML
2002
ACM
123views Machine Learning» more  ML 2002»
15 years 7 months ago
Feature Generation Using General Constructor Functions
Most classification algorithms receive as input a set of attributes of the classified objects. In many cases, however, the supplied set of attributes is not sufficient for creatin...
Shaul Markovitch, Dan Rosenstein
222
Voted
ECCV
2004
Springer
16 years 9 months ago
Region-Based Segmentation on Evolving Surfaces with Application to 3D Reconstruction of Shape and Piecewise Constant Radiance
Abstract. We consider the problem of estimating the shape and radiance of a scene from a calibrated set of images under the assumption that the scene is Lambertian and its radiance...
Hailin Jin, Anthony J. Yezzi, Stefano Soatto