Sciweavers

41 search results - page 6 / 9
» Girth and euclidean distortion
Sort
View
ICIP
2005
IEEE
14 years 9 months ago
An efficient algorithm for informed embedding of dirty-paper trellis codes for watermarking
Dirty paper trellis codes are a form of watermarking with side information. These codes have the advantage of being invariant to valumetric scaling of the cover Work. However, the...
Gwenaël J. Doërr, Ingemar J. Cox, Lin Li...
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
14 years 8 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney
GLOBECOM
2007
IEEE
14 years 2 months ago
Volume Growth and General Rate Quantization on Grassmann Manifolds
—The Grassmann manifold Gn,p (L) is the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space Ln , where L is either R or C. This paper consid...
Wei Dai, Brian Rider, Youjian Liu
COMPGEOM
2008
ACM
13 years 9 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
DCG
2010
171views more  DCG 2010»
13 years 8 months ago
Bregman Voronoi Diagrams
The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dual...
Jean-Daniel Boissonnat, Frank Nielsen, Richard Noc...