1554 search results - page 67 / 311 » Parameterized Complexity and Approximation Algorithms |
114
Voted
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
160
Voted
MOBICOM
2006
ACM
15 years 8 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
213
Voted
ICCABS
2011
14 years 6 months ago
2011
—Research efforts to analyze biomolecular properties contribute towards our understanding of biomolecular function. Calculating non-bonded forces (or in our case, electrostatic s...
99
Voted
LATIN
1998
Springer
15 years 7 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
110
Voted
ASAP
2005
IEEE
15 years 8 months ago
2005
IEEE
The Radon transform (RT) is a widely studied algorithm used to perform image pattern extraction in fields such as computer graphics, medical imagery, and avionics. Real-time impl...