338 search results - page 4 / 68 » Effective Lower Bounding Techniques for Pseudo-Boolean Optim... |
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
FOCS
2004
IEEE
14 years 24 days ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
RTAS
2006
IEEE
2006
IEEE
METERG: Measurement-Based End-to-End Performance Estimation Technique in QoS-Capable Multiprocessors
14 years 3 months ago
Multiprocessor systems present serious challenges in the design of real-time systems due to the wider variation of execution time of an instruction sequence compared to a uniproce...
CPM
2007
Springer
14 years 1 months ago
2007
Springer
Move-to-Front, Distance Coding and Inversion Frequencies are three simple and effective techniques used to process the output of the Burrows-Wheeler Transform. In this paper we pr...
COCO
2003
Springer
14 years 2 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...