Sciweavers

817 search results - page 47 / 164
» Robust Euclidean embedding
Sort
View
BROADNETS
2007
IEEE
15 years 4 months ago
Optimizing dimensionality and accelerating landmark positioning for coordinates based RTT predictions
Abstract— In this paper we analyze the positioning of landmarks in coordinates-based Internet distance prediction approaches with focus on Global Network Positioning (GNP). We sh...
Dragan Milic, Torsten Braun
AAAI
2007
15 years 3 days ago
Isometric Projection
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...
Deng Cai, Xiaofei He, Jiawei Han
ICIP
2001
IEEE
15 years 11 months ago
Multi-level watermarking with independent decoding
A drawback of most watermarking techniques is the need for some additional information in order to retrieve the watermark. Additionally, the robustness of the watermark decreases ...
Moshe Butman, Hagit Zabrodsky Hel-Or
ICASSP
2011
IEEE
14 years 1 months ago
A new data hiding method using angle quantization index modulation in gradient domain
A robust data hiding scheme that embeds the watermark bits by quantizing the gradient directions of an image is proposed. By embedding the watermark in the angle, the watermark be...
Ehsan Nezhadarya, Z. Jane Wang, Rabab K. Ward
ICML
2002
IEEE
15 years 10 months ago
Learning the Kernel Matrix with Semi-Definite Programming
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
Gert R. G. Lanckriet, Nello Cristianini, Peter L. ...