Sciweavers

828 search results - page 59 / 166
» Simplicial Powers of Graphs
Sort
View
CVPR
2007
IEEE
14 years 3 months ago
Conformal Embedding Analysis with Local Graph Modeling on the Unit Hypersphere
We present the Conformal Embedding Analysis (CEA) for feature extraction and dimensionality reduction. Incorporating both conformal mapping and discriminating analysis, CEA projec...
Yun Fu, Ming Liu, Thomas S. Huang
IMA
2001
Springer
80views Cryptology» more  IMA 2001»
14 years 1 months ago
Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement
A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform. W...
Matthew G. Parker
ASPDAC
1999
ACM
157views Hardware» more  ASPDAC 1999»
14 years 1 months ago
A Genetic Algorithm based Approach for Multi-Objective Data-Flow Graph Optimization
: This paper presents a genetic algorithm based approach for algebraic optimization of behavioral system specifications. We introduce a chromosomal representation of data-flow gr...
Birger Landwehr
COMBINATORICA
2008
78views more  COMBINATORICA 2008»
13 years 8 months ago
Optimal strong parity edge-coloring of complete graphs
A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G havi...
David P. Bunde, Kevin Milans, Douglas B. West, Heh...
JMLR
2008
108views more  JMLR 2008»
13 years 8 months ago
A Recursive Method for Structural Learning of Directed Acyclic Graphs
In this paper, we propose a recursive method for structural learning of directed acyclic graphs (DAGs), in which a problem of structural learning for a large DAG is first decompos...
Xianchao Xie, Zhi Geng