Sciweavers

55 search results - page 5 / 11
» Linear Orderings of Random Geometric Graphs
Sort
View
TSMC
2010
14 years 4 months ago
Geometric Distortion Insensitive Image Watermarking in Affine Covariant Regions
Feature-based image watermarking schemes, which aim to survive various geometric distortions, have attracted great attention in recent years. Existing schemes have shown robustness...
Xinbo Gao, Cheng Deng, Xuelong Li, Dacheng Tao
85
Voted
IMAMS
2003
125views Mathematics» more  IMAMS 2003»
14 years 11 months ago
A Graph-Spectral Method for Surface Height Recovery
This paper describes a graph-spectral method for 3D surface integration. The algorithm takes as its input a 2D field of surface normal estimates, delivered, for instance, by a sh...
Antonio Robles-Kelly, Edwin R. Hancock
83
Voted
WG
1993
Springer
15 years 1 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
81
Voted
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
15 years 3 months ago
Orthogonal Neighborhood Preserving Projections
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
Effrosini Kokiopoulou, Yousef Saad
90
Voted
TCOM
2010
109views more  TCOM 2010»
14 years 8 months ago
Results on Finite Wireless Networks on a Line
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
Ali Eslami, Mohammad Nekoui, Hossein Pishro-Nik