Sciweavers

145 search results - page 18 / 29
» Front Representation of Set Partitions
Sort
View
ICPR
2008
IEEE
14 years 4 months ago
Establishing point correspondence using multidirectional binary pattern for face recognition
This paper presents a new Multidirectional Binary Pattern (MBP) for face recognition. Different from most Local Binary Pattern (LBP) related approaches which cluster LBP occurrenc...
Sanqiang Zhao, Yongsheng Gao
FDL
2007
IEEE
14 years 4 months ago
Time Modeling in MARTE
This article introduces the Time Model subprofile of MARTE, a new OMG UML Profile dedicated to Modeling and Analysis of Real-Time and Embedded systems. After a brief presentatio...
Robert de Simone, Charles André
EVOW
2005
Springer
14 years 3 months ago
Automated Photogrammetric Network Design Using the Parisian Approach
We present a novel camera network design methodology based on the Parisian approach to evolutionary computation. The problem is partitioned into a set of homogeneous elements, whos...
Enrique Dunn, Gustavo Olague, Evelyne Lutton
PODC
2010
ACM
14 years 1 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer
NN
2006
Springer
127views Neural Networks» more  NN 2006»
13 years 9 months ago
Assessing self organizing maps via contiguity analysis
- Contiguity Analysis is a straightforward generalization of Linear Discriminant Analysis in which the partition of elements is replaced by a more general graph structure. Applied ...
Ludovic Lebart