Sciweavers

927 search results - page 128 / 186
» A Data Abstraction Alternative to Data Structure Algorithm M...
Sort
View
121
Voted
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 2 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
117
Voted
TSP
2008
118views more  TSP 2008»
15 years 2 months ago
A Block Component Model-Based Blind DS-CDMA Receiver
In this paper, we consider the problem of blind multiuser separation-equalization in the uplink of a wideband DS-CDMA system, in a multipath propagation environment with intersymbo...
Dimitri Nion, Lieven De Lathauwer
162
Voted
TSP
2010
14 years 9 months ago
Decentralized sparse signal recovery for compressive sleeping wireless sensor networks
Abstract--This paper develops an optimal decentralized algorithm for sparse signal recovery and demonstrates its application in monitoring localized phenomena using energy-constrai...
Qing Ling, Zhi Tian
PVLDB
2008
110views more  PVLDB 2008»
15 years 2 months ago
Online maintenance of very large random samples on flash storage
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...
Suman Nath, Phillip B. Gibbons
KDD
2007
ACM
124views Data Mining» more  KDD 2007»
15 years 8 months ago
Hierarchical mixture models: a probabilistic analysis
Mixture models form one of the most widely used classes of generative models for describing structured and clustered data. In this paper we develop a new approach for the analysis...
Mark Sandler