Sciweavers

28 search results - page 1 / 6
» A local criterion for Tverberg graphs
Sort
View
COMBINATORICA
2011
12 years 7 months ago
A local criterion for Tverberg graphs
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
Alexander Engström
JCT
2006
134views more  JCT 2006»
13 years 7 months ago
MacLane's planarity criterion for locally finite graphs
MacLane's planarity criterion states that a finite graph is planar if and only if its cycle space has a basis B such that every edge is contained in at most two members of B....
Henning Bruhn, Maya Jakobine Stein
PAMI
2012
11 years 10 months ago
Angular Embedding: A Robust Quadratic Criterion
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
Stella Yu
PR
2010
145views more  PR 2010»
13 years 6 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
IPPS
1999
IEEE
13 years 12 months ago
Distributed Scheduling with Decomposed Optimization Criterion: Genetic Programming Approach
Abstract. A new approach to develop parallel and distributed scheduling algorithms for multiprocessor systems is proposed. Its main innovation lies in evolving a decomposition of t...
Franciszek Seredynski, Jacek Koronacki, Cezary Z. ...