Sciweavers

239 search results - page 14 / 48
» Some Results on Greedy Embeddings in Metric Spaces
Sort
View
105
Voted
TKDE
2008
128views more  TKDE 2008»
14 years 9 months ago
A Virtual Ring Method for Building Small-World Structured P2P Overlays
This paper presents a general virtual ring method to design and analyze small-world structured P2P networks on the base es embedded in ID spaces with distance metric. Its basic ide...
Hai Zhuge, Xiaoping Sun
NIPS
2003
14 years 10 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand
AAAI
1998
14 years 10 months ago
"Squeaky Wheel" Optimization
We describe a general approach to optimization which we term Squeaky Wheel" Optimization SWO. In SWO, a greedy algorithm is used to construct a solution which is then analyze...
David Joslin, David P. Clements
CVPR
2006
IEEE
15 years 3 months ago
Learning Non-Metric Partial Similarity Based on Maximal Margin Criterion
The performance of many computer vision and machine learning algorithms critically depends on the quality of the similarity measure defined over the feature space. Previous works...
Xiaoyang Tan, Songcan Chen, Jun Li, Zhi-Hua Zhou
VCIP
2003
152views Communications» more  VCIP 2003»
14 years 10 months ago
Robust approach for color image quality assessment
This paper presents a visual color image quality metric assessment with full reference image. The metric is highly based on human visual system properties in order to get the best...
Patrick Le Callet, Dominique Barba