79 search results - page 2 / 16 » Worst-case analysis of generalized heapsort algorithm revisi... |
MOBIHOC
2003
ACM
14 years 7 months ago
2003
ACM
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
DAGSTUHL
2004
13 years 8 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
SAC
2010
ACM
14 years 2 months ago
2010
ACM
The FlexRay protocol [4] is likely to be the de facto standard for automotive communication systems. Hence, there is a need to provide hard performance guarantees on properties li...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
UAI
2008
13 years 8 months ago
2008
We conjecture that the worst case number of experiments necessary and sufficient to discover a causal graph uniquely given its observational Markov equivalence class can be specif...