Sciweavers

312 search results - page 22 / 63
» Iterative compression and exact algorithms
Sort
View
SPIRE
2007
Springer
14 years 4 months ago
Approximate String Matching with Lempel-Ziv Compressed Indexes
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...
ICPR
2004
IEEE
14 years 11 months ago
Efficient Model Selection for Kernel Logistic Regression
Kernel logistic regression models, like their linear counterparts, can be trained using the efficient iteratively reweighted least-squares (IRWLS) algorithm. This approach suggest...
Gavin C. Cawley, Nicola L. C. Talbot
ICC
2007
IEEE
101views Communications» more  ICC 2007»
14 years 4 months ago
On the Limitations of Random Sensor Placement for Distributed Signal Detection
— We consider the design of a sensor network for detecting an emitter who if present is known to be located in an interval but whose exact position is unknown. We seek to minimiz...
Zhenyu Tu, Rick S. Blum
TSP
2010
13 years 4 months ago
Sparse channel estimation for multicarrier underwater acoustic communication: from subspace methods to compressed sensing
Abstract--In this paper, we investigate various channel estimators that exploit channel sparsity in the time and/or Doppler domain for a multicarrier underwater acoustic system. We...
Christian R. Berger, Shengli Zhou, James C. Preisi...
FSE
2011
Springer
263views Cryptology» more  FSE 2011»
13 years 1 months ago
Practical Near-Collisions on the Compression Function of BMW
Abstract. Blue Midnight Wish (BMW) is one of the fastest SHA-3 candidates in the second round of the competition. In this paper we study the compression function of BMW and we obta...
Gaëtan Leurent, Søren S. Thomsen