Sciweavers

16 search results - page 3 / 4
» A Practical Minimal Perfect Hashing Method
Sort
View
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
14 years 3 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon
EMNLP
2010
13 years 4 months ago
Storing the Web in Memory: Space Efficient Language Models with Constant Time Retrieval
We present three novel methods of compactly storing very large n-gram language models. These methods use substantially less space than all known approaches and allow n-gram probab...
David Guthrie, Mark Hepple
CGF
2008
150views more  CGF 2008»
13 years 6 months ago
Compact, Fast and Robust Grids for Ray Tracing
The focus of research in acceleration structures for ray tracing recently shifted from render time to time to image, the sum of build time and render time, and also the memory foo...
Ares Lagae, Philip Dutré
ICC
2008
IEEE
107views Communications» more  ICC 2008»
14 years 21 days ago
Minimum BER Transmit Beamforming for MIMO-OFDM Systems with Finite Rate Feedback
— In this paper, we consider minimum bit error rate (BER) beamforming (BF) for multiple–input multiple–output orthogonal frequency division multiplexing (MIMO–OFDM) systems...
Yang-wen Liang, Robert Schober, Wolfgang H. Gersta...
ETT
2007
90views Education» more  ETT 2007»
13 years 6 months ago
Algorithms and applications of channel impulse response length estimation for MIMO-OFDM
Abstract— The performance of the widely applied timedomain channel estimation for SISO- and MIMO-OFDM systems strongly depends on the preciseness of information regarding maximum...
Marco Krondorf, Ting-Jung Liang, M. Goblirsch, Ger...