Sciweavers

1538 search results - page 30 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
ICCV
2003
IEEE
14 years 12 months ago
Spectral Partitioning for Structure from Motion
We propose a spectral partitioning approach for large-scale optimization problems, specifically structure from motion. In structure from motion, partitioning methods reduce the pr...
Drew Steedly, Irfan A. Essa, Frank Dellaert
IH
1999
Springer
14 years 2 months ago
An Asymmetric Public Detection Watermarking Technique
The new watermarking technique1 presented in this paper is an example of an asymmetric public detection scheme. The detection process does not need the original picture nor the sec...
Teddy Furon, Pierre Duhamel
SDM
2010
SIAM
153views Data Mining» more  SDM 2010»
13 years 11 months ago
Reconstruction from Randomized Graph via Low Rank Approximation
The privacy concerns associated with data analysis over social networks have spurred recent research on privacypreserving social network analysis, particularly on privacypreservin...
Leting Wu, Xiaowei Ying, Xintao Wu
PVLDB
2008
108views more  PVLDB 2008»
13 years 9 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
COCOON
2007
Springer
14 years 2 months ago
Improved Exact Algorithms for Counting 3- and 4-Colorings
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh