Sciweavers

1728 search results - page 133 / 346
» The Accelerated Euclidean Algorithm
Sort
View
GD
2006
Springer
15 years 6 months ago
Morphing Planar Graphs in Spherical Space
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
Stephen G. Kobourov, Matthew Landis
SDM
2007
SIAM
98views Data Mining» more  SDM 2007»
15 years 4 months ago
An incremental data-stream sketch using sparse random projections
We propose the use of random projections with a sparse matrix to maintain a sketch of a collection of high-dimensional data-streams that are updated asynchronously. This sketch al...
Aditya Krishna Menon, Gia Vinh Anh Pham, Sanjay Ch...
NIPS
2004
15 years 4 months ago
Supervised Graph Inference
We formulate the problem of graph inference where part of the graph is known as a supervised learning problem, and propose an algorithm to solve it. The method involves the learni...
Jean-Philippe Vert, Yoshihiro Yamanishi
IJNSEC
2008
106views more  IJNSEC 2008»
15 years 3 months ago
Comments on the Security Flaw of Hwang et al.'s Blind Signature Scheme
In 2003, Hwang et al. proposed a new blind signature based on the RSA cryptosystem by employing Extended Euclidean algorithm. They claimed that the proposed scheme was untraceable...
Fang-Ping Chiang, Yi-Mien Lin, Ya-Fen Chang
PRL
2008
356views more  PRL 2008»
15 years 3 months ago
Improving image segmentation by gradient vector flow and mean shift
The classical gradient vector flow (GVF) method suffers from deficiency in the presence of other significant edges adjacent to the real boundary. In this paper, we propose an impr...
Tangwei Liu, Huiyu Zhou, Faquan Lin, Yusheng Pang,...