Sciweavers

1029 search results - page 29 / 206
» Compact representations of ordered sets
Sort
View
ORDER
2010
96views more  ORDER 2010»
15 years 28 days ago
More Sublattices of the Lattice of Local Clones
We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at ...
Michael Pinsker
COMCOM
2004
85views more  COMCOM 2004»
15 years 2 months ago
Optimal PNNI complex node representations for restrictive costs
The Private Network-to-Network Interface (PNNI) is a scalable hierarchical protocol that allows ATM switches to be aggregated into clusters called peer groups. To provide good acc...
Ilias Iliadis
107
Voted
CVPR
2009
IEEE
15 years 9 months ago
Resolution-Invariant Image Representation and its applications
We present a Resolution-Invariant Image Representation (RIIR) framework in this paper. The RIIR framework includes the methods of building a set of multi-resolution bases from tra...
Jinjun Wang, Shenghuo Zhu, Yihong Gong
3DIM
2003
IEEE
15 years 6 months ago
Surflet-Pair-Relation Histograms: A Statistical 3D-Shape Representation for Rapid Classification
A statistical representation of three-dimensional shapes is introduced, based on a novel four-dimensional feature. The feature parameterizes the intrinsic geometrical relation of ...
Eric Wahl, Ulrich Hillenbrand, Gerd Hirzinger
CPM
2010
Springer
180views Combinatorics» more  CPM 2010»
15 years 7 months ago
Algorithms for Three Versions of the Shortest Common Superstring Problem
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
Maxime Crochemore, Marek Cygan, Costas S. Iliopoul...