Sciweavers

2735 search results - page 79 / 547
» Generalized Displacement Maps
Sort
View
ICPR
2010
IEEE
13 years 9 months ago
Efficient Encoding of N-D Combinatorial Pyramids
Combinatorial maps define a general framework which allows to encode any subdivision of an n-D orientable quasi-manifold with or without boundaries. Combinatorial pyramids are def...
Sébastien Fourey, Luc Brun
GBRPR
2009
Springer
13 years 5 months ago
A First Step toward Combinatorial Pyramids in n-D Spaces
Abstract. Combinatorial maps define a general framework which allows to encode any subdivision of an nD orientable quasi-manifold with or without boundaries. Combinatorial pyramids...
Sébastien Fourey, Luc Brun
DGO
2006
129views Education» more  DGO 2006»
13 years 9 months ago
Automatic alignment of vector data and orthoimagery for the national map
A general problem in combining road vector data with orthoimagery from different sources is that they rarely align. There are a variety of causes to this problem, but the most com...
Craig A. Knoblock, Cyrus Shahabi, Ching-Chien Chen...
PAMI
2006
141views more  PAMI 2006»
13 years 7 months ago
Diffusion Maps and Coarse-Graining: A Unified Framework for Dimensionality Reduction, Graph Partitioning, and Data Set Parameter
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
Stéphane Lafon, Ann B. Lee
DAC
2006
ACM
14 years 8 months ago
Optimal simultaneous mapping and clustering for FPGA delay optimization
Both technology mapping and circuit clustering have a large impact on FPGA designs in terms of circuit performance, area, and power dissipation. Existing FPGA design flows carry o...
Joey Y. Lin, Deming Chen, Jason Cong