10608 search results - page 263 / 2122 » Complexity of O'Hara's Algorithm |
102
Voted
CAIP
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. In this article, we deal with fast algorithms for the quaternionic Fourier transform (QFT). Our aim is to give a guideline for choosing algorithms in practical cases. Hen...
CORR
2010
Springer
15 years 19 days ago
2010
Springer
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
131
Voted
PODS
2012
ACM
13 years 3 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
115
click to vote
CORR
1999
Springer
15 years 6 days ago
1999
Springer
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a singl...
121
click to vote
SECURWARE
2008
IEEE
15 years 7 months ago
2008
IEEE
Firewalls provide the first line of defence of nearly all networked institutions today. However, Firewall ACLs could have inconsistencies, allowing traffic that should be denied o...