Sciweavers

140 search results - page 21 / 28
» On simultaneous planar graph embeddings
Sort
View
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 5 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...
ICPR
2010
IEEE
13 years 11 months ago
Face Recognition Using a Multi-Manifold Discriminant Analysis Method
—In this paper, we propose a Multi-Manifold Discriminant Analysis (MMDA) method for face feature extraction and face recognition, which is based on graph embedded learning and un...
Wankou Yang, Changyin Sun, Lei Zhang
NIPS
2008
13 years 8 months ago
Dimensionality Reduction for Data in Multiple Feature Representations
In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. These representa...
Yen-Yu Lin, Tyng-Luh Liu, Chiou-Shann Fuh
COMBINATORICS
2006
103views more  COMBINATORICS 2006»
13 years 6 months ago
A Note on Domino Shuffling
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification...
É. Janvresse, T. de la Rue, Y. Velenik
SIAMDM
2010
194views more  SIAMDM 2010»
13 years 1 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...