16404 search results - page 243 / 3281 » A set coverage problem |
168
click to vote
SSIAI
2002
IEEE
15 years 9 months ago
2002
IEEE
Motion-based segmentation of image sequences is an important problem of image analysis, with numerous applications to image coding and image manipulation. We present a novel algor...
137
click to vote
DCOSS
2009
Springer
15 years 9 months ago
2009
Springer
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E)...
131
click to vote
FOIKS
2008
Springer
15 years 5 months ago
2008
Springer
We present a method for decomposing a hypergraph with certain regularities into smaller hypergraphs. By applying this to the set of all canonical covers of a given set of functiona...
172
click to vote
ACST
2006
15 years 5 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
118
click to vote
FIMI
2003
15 years 5 months ago
2003
We describe an implementation of an algorithm for enumerating all maximal frequent sets using irredundant dualization, which is an improved version of that of Gunopulos et al. The...