Sciweavers

1190 search results - page 102 / 238
» On the Structure of Syntenic Distance
Sort
View
ESA
2007
Springer
81views Algorithms» more  ESA 2007»
15 years 4 months 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...
PAKDD
2007
ACM
158views Data Mining» more  PAKDD 2007»
15 years 4 months ago
Density-Sensitive Evolutionary Clustering
In this study, we propose a novel evolutionary algorithm-based clustering method, named density-sensitive evolutionary clustering (DSEC). In DSEC, each individual is a sequence of ...
Maoguo Gong, Licheng Jiao, Ling Wang, Liefeng Bo
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
15 years 4 months ago
Coverage Diameters of Polygons
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
Pawin Vongmasa, Attawith Sudsang
IROS
2006
IEEE
103views Robotics» more  IROS 2006»
15 years 4 months ago
Trinocular Spherical Stereo
–In contrast with the conventional trinocular planar image stereo in which the third camera is usually used to reduce the ambiguity on matching, every spherical camera of trinocu...
Shigang Li
ICMCS
2005
IEEE
79views Multimedia» more  ICMCS 2005»
15 years 3 months ago
Supervised semi-definite embedding for image manifolds
Semi-definite Embedding (SDE) has been a recently proposed to maximize the sum of pair wise squared distances between outputs while the input data and outputs are locally isometri...
Benyu Zhang, Jun Yan, Ning Liu, QianSheng Cheng, Z...