Sciweavers

1068 search results - page 107 / 214
» On Space Bounded Server Algorithms
Sort
View
JMIV
2010
87views more  JMIV 2010»
13 years 6 months ago
Infinite Photography: New Mathematical Model for High-Resolution Images
A new mathematical image model is introduced using the photographic process as the starting point. Images are represented as infinite sequences of photons allowing analysis at arb...
Tapio Helin, Matti Lassas, Samuli Siltanen
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
14 years 8 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
WCNC
2008
IEEE
14 years 2 months ago
Subspace Blind MIMO-OFDM Channel Estimation with Short Averaging Periods: Performance Analysis
—Among all blind channel estimation problems, subspace-based algorithms are attractive due to its fastconverging nature. It primarily exploits the orthogonality structure of the ...
Chao-Cheng Tu, Benoît Champagne
DISOPT
2011
210views Education» more  DISOPT 2011»
13 years 2 months ago
The parameterized complexity of k-flip local search for SAT and MAX SAT
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
Stefan Szeider
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
14 years 9 months ago
Randomized Synopses for Query Assurance on Data Streams
The overwhelming flow of information in many data stream applications forces many companies to outsource to a third-party the deployment of a Data Stream Management System (DSMS) f...
Ke Yi, Feifei Li, Marios Hadjieleftheriou, George ...