10608 search results - page 638 / 2122 » Complexity of O'Hara's Algorithm |
203
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
178
click to vote
SIGMOD
2004
ACM
16 years 7 months ago
2004
ACM
We present BLAS , a Bi-LAbeling based System, for efficiently processing complex XPath queries over XML data. BLAS uses Plabeling to process queries involving consecutive child ax...
166
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
191
click to vote
ICFCA
2010
Springer
16 years 2 months ago
2010
Springer
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
204
click to vote
AIIA
2009
Springer
16 years 1 months ago
2009
Springer
Wireless sensor networks (WSNs) represent a typical domain where there are complex temporal sequences of events. In this paper we propose a relational framework to model and analys...