Sciweavers

1201 search results - page 3 / 241
» Linear Probing and Graphs
Sort
View
BMCBI
2010
111views more  BMCBI 2010»
13 years 5 months ago
Dynamic probe selection for studying microbial transcriptome with high-density genomic tiling microarrays
Background: Current commercial high-density oligonucleotide microarrays can hold millions of probe spots on a single microscopic glass slide and are ideal for studying the transcr...
Hedda Høvik, Tsute Chen
ASIAN
2004
Springer
69views Algorithms» more  ASIAN 2004»
13 years 10 months ago
Using Optimal Golomb Rulers for Minimizing Collisions in Closed Hashing
Abstract. We give conditions for hash table probing which minimize the expected number of collisions. A probing algorithm is determined by a sequence of numbers denoting jumps for ...
Lars Lundberg, Håkan Lennerstad, Kamilla Klo...
ICASSP
2011
IEEE
12 years 9 months ago
A novel probe processing method for underwater communication by passive-phase conjugation
Underwater acoustic communication by passive-phase conjugation uses a channel probe signal transmitted prior to the data signal in order to estimate the channel response. At the r...
Guosong Zhang, Jens M. Hovem, Hefeng Dong, Paul A....
AAIM
2007
Springer
97views Algorithms» more  AAIM 2007»
13 years 11 months ago
Probe Matrix Problems: Totally Balanced Matrices
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
David B. Chandler, Jiong Guo, Ton Kloks, Rolf Nied...