Sciweavers

174 search results - page 2 / 35
» Practically Perfect
Sort
View
SIGIR
1992
ACM
13 years 9 months ago
A Faster Algorithm for Constructing Minimal Perfect Hash Functions
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...
Edward A. Fox, Qi Fan Chen, Lenwood S. Heath
CISS
2007
IEEE
13 years 12 months ago
Limited Feedback Precoder Design for Spatially Correlated MIMO Channels
Abstract— It is well-known that perfect channel state information (CSI) at the transmitter and the receiver (CSIT/CSIR) can be used to decompose a multi-antenna channel into a ba...
Vasanthan Raghavan, Akbar M. Sayeed, Venugopal V. ...
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...
ICONIP
1998
13 years 7 months ago
An Application of ELISA to Perfect Hashing with Deterministic Ordering
This paper describes a practical application of a novel terminal attractor algorithm to the construction of Perfect Hash Functions (PHF) for a prede ned set of keys. The proposed ...
Monica Bianchini, Stefano Fanelli, Marco Gori
TCBB
2008
101views more  TCBB 2008»
13 years 5 months ago
The Undirected Incomplete Perfect Phylogeny Problem
The incomplete perfect phylogeny (IPP) problem and the incomplete perfect phylogeny haplotyping (IPPH) problem deal with constructing a phylogeny for a given set of haplotypes or g...
Ravi Vijaya Satya, Amar Mukherjee