Sciweavers

2489 search results - page 188 / 498
» On the Subgroup Distance Problem
Sort
View
DM
2006
108views more  DM 2006»
15 years 4 months ago
Optimal broadcast domination in polynomial time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination...
Pinar Heggernes, Daniel Lokshtanov
IPL
2010
65views more  IPL 2010»
15 years 2 months ago
Multicasting in the hypercube, chord and binomial graphs
We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish ...
Christopher C. Cipriano, Teofilo F. Gonzalez
GC
2011
Springer
14 years 8 months ago
Minimum Clique Partition in Unit Disk Graphs
The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding...
Adrian Dumitrescu, János Pach
ICIP
2007
IEEE
16 years 6 months ago
Faithful Shape Representation for 2D Gaussian Mixtures
It has been recently discovered that a faithful representation for the shape of some simple distributions can be constructed using invariant statistics [1, 2]. In this paper, we c...
Mireille Boutin, Mary I. Comer
ICIP
2004
IEEE
16 years 6 months ago
Camera calibration without metric information using 1D objects
This paper addresses the problem of calibrating a pin-hole camera from images of 1D objects. Assuming a unit aspect ratio and zero skew, we introduce a novel and simple approach t...
Xiaochun Cao, Hassan Foroosh