Sciweavers

817 search results - page 31 / 164
» On 2-factors with k components
Sort
View
ESA
2007
Springer
81views Algorithms» more  ESA 2007»
16 years 7 days ago
Farthest-Polygon Voronoi Diagrams
Given a family of k disjoint connected polygonal sites of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the dis...
Otfried Cheong, Hazel Everett, Marc Glisse, Joachi...
ICA
2004
Springer
15 years 11 months ago
ICA Using Kernel Entropy Estimation with NlogN Complexity
Abstract. Mutual information (MI) is a common criterion in independent component analysis (ICA) optimization. MI is derived from probability density functions (PDF). There are scen...
Sarit Shwartz, Michael Zibulevsky, Yoav Y. Schechn...
IPPS
2006
IEEE
16 years 3 days ago
k-anycast routing schemes for mobile ad hoc networks
— Anycast is a communication paradigm that was first introduced to the suit of routing protocols in IPv6 networks. In anycast, a packet is intended to be delivered to one of the...
Bing Wu, Jie Wu
ICCV
2003
IEEE
16 years 8 months ago
Shape Representation via Harmonic Embedding
We present a novel representation of shape for closed planar contours explicitly designed to possess a linear structure. This greatly simplifies linear operations such as averagin...
Alessandro Duci, Anthony J. Yezzi, Sanjoy K. Mitte...
ICIP
2008
IEEE
16 years 15 days ago
Texture modulation-constrained image decomposition
Texture modeling and separation of structure in images are treated in synergy. A variational image decomposition scheme is formulated using explicit texture reconstruction constra...
Georgios Evangelopoulos, Petros Maragos