Sciweavers

511 search results - page 57 / 103
» The intrinsic dimensionality of graphs
Sort
View
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 10 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
GD
2004
Springer
14 years 3 months ago
Layout Volumes of the Hypercube
We study 3-dimensional layouts of the hypercube in a 1-active layer and general model. The problem can be understood as a graph drawing problem in 3D space and was addressed at Gr...
Lubomir Torok, Imrich Vrto
PR
2010
145views more  PR 2010»
13 years 8 months ago
Graph-optimized locality preserving projections
Locality preserving projections (LPP) is a typical graph-based dimensionality reduction (DR) method, and has been successfully applied in many practical problems such as face recog...
Limei Zhang, Lishan Qiao, Songcan Chen
CVPR
2009
IEEE
15 years 5 months ago
The Geometry of 2D Image Signals
This paper covers a fundamental problem of local phase based signal processing: the isotropic generalization of the classical 1D analytic signal to two dimensions. The well know...
Lennart Wietzke (Kiel University), Gerald Sommer (...
ICCV
2003
IEEE
14 years 12 months ago
An affine invariant deformable shape representation for general curves
Automatic construction of Shape Models from examples has been the focus of intense research during the last couple of years. These methods have proved to be useful for shape segme...
Anders Ericsson, Kalle Åström