Sciweavers

373 search results - page 8 / 75
» On Deterministic Approximation of DNF
Sort
View
AAIM
2006
Springer
75views Algorithms» more  AAIM 2006»
14 years 1 months ago
Subsequence Packing: Complexity, Approximation, and Application
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
Minghui Jiang
MMAS
2012
Springer
12 years 3 months ago
Coupled Wideangle Wave Approximations
In this paper we analyze wave propagation in three-dimensional random media. We consider a source with limited spatial and temporal support that generates spherically diverging wav...
Josselin Garnier, Knut Sølna
PODS
2004
ACM
148views Database» more  PODS 2004»
14 years 7 months ago
Deterministic Wavelet Thresholding for Maximum-Error Metrics
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
Minos N. Garofalakis, Amit Kumar
PE
2008
Springer
173views Optimization» more  PE 2008»
13 years 7 months ago
M/G/1 queue with deterministic reneging times
We consider single-server and multi-server queues with deterministic reneging times motivated by the timeout mechanisms used in application servers.. A Volterra integral equation ...
Wei Xiong, David L. Jagerman, Tayfur Altiok
WAOA
2007
Springer
158views Algorithms» more  WAOA 2007»
14 years 1 months ago
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
Anke van Zuylen, David P. Williamson