Sciweavers

139 search results - page 2 / 28
» Fast perfect sampling from linear extensions
Sort
View
ICASSP
2011
IEEE
12 years 9 months ago
Sampling and reconstructing diffusion fields with localized sources
We study the spatiotemporal sampling of a diffusion field generated by K point sources, aiming to fully reconstruct the unknown initial field distribution from the sample measur...
Juri Ranieri, Amina Chebira, Yue M. Lu, Martin Vet...
WG
1993
Springer
13 years 9 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
ICIP
2007
IEEE
14 years 7 months ago
Subspace Extension to Phase Correlation Approach for Fast Image Registration
A novel extension of phase correlation to subspace correlation is proposed, in which 2-D translation is decomposed into two 1-D motions thus only 1-D Fourier transform is used to ...
Jinchang Ren, Theodore Vlachos, Jianmin Jiang
SBBD
2008
256views Database» more  SBBD 2008»
13 years 7 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
TSP
2010
13 years 9 days ago
A continuous-time linear system identification method for slowly sampled data
Both direct and indirect methods exist for identifying continuous-time linear systems. A direct method estimates continuous-time input and output signals from their samples and the...
Damián Marelli, Minyue Fu