Sciweavers

258 search results - page 5 / 52
» Relational Correspondences for Lattices with Operators
Sort
View
KNINVI
2005
Springer
14 years 29 days ago
Representational Correspondence as a Basic Principle of Diagram Design
The timeworn claim that a picture is worth a thousand words is generally well-supported by empirical evidence, suggesting that diagrams and other information graphics can enhance h...
Christopher F. Chabris, Stephen M. Kosslyn
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
13 years 7 months ago
Trees and Matchings
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
Richard Kenyon, James Gary Propp, David Bruce Wils...
STACS
2009
Springer
14 years 2 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert
ICIP
2008
IEEE
14 years 1 months ago
Raising in watershed lattices
The watershed segmentation is a popular tool in image processing. Starting from an initial map, the border thinning transformation produces a map whose minima constitute the catch...
Jean Cousty, Laurent Najman, Jean Serra
ACTA
2000
82views more  ACTA 2000»
13 years 7 months ago
Semantics analysis through elementary meanings
Thesaurus is a collection of words classified according to some relatedness measures among them. In this paper, we lay the theoretical foundations of thesaurus construction through...
Youichi Kobuchi, Takashi Saito, Hidenobu Nunome