2214 search results - page 117 / 443 » complexity 2004 |
CPAIOR
2004
Springer
14 years 2 months ago
2004
Springer
So far, edge-finding is the only one major filtering algorithm for unary resource constraint with time complexity O(n log n). This paper proposes O(n log n) versions of another t...
CTRSA
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. This paper analyses periodic properties of counter assisted stream ciphers. In particular, we analyze constructions where the counter system also has the purpose of provi...
DIS
2004
Springer
14 years 2 months ago
2004
Springer
In this paper we consider privacy problems with anonymized transaction databases, i.e., transaction databases where the items are renamed in order to hide sensitive information. In...
EGOV
2004
Springer
14 years 2 months ago
2004
Springer
We report on research aimed at gaining an improved understanding of how issues such as language, literacy and previous exposure to technology affect citizens’ ability to access g...
ESA
2004
Springer
14 years 2 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...