Sciweavers

19320 search results - page 279 / 3864
» On the complexity of computing determinants
Sort
View
SPAA
2006
ACM
16 years 18 days ago
The cache complexity of multithreaded cache oblivious algorithms
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
Matteo Frigo, Volker Strumpen
ADHOCNOW
2008
Springer
15 years 7 months ago
Adaptive Priority Based Distributed Dynamic Channel Assignment for Multi-radio Wireless Mesh Networks
Abstract. This paper investigates the challenges involve in designing a dynamic channel assignment (DCA) scheme for wireless mesh networks, particularly for multi-radio systems. It...
Tope R. Kareem, Karel Matthee, H. Anthony Chan, Nt...
SEMCO
2007
IEEE
16 years 28 days ago
Corpus-based Pattern Induction for a Knowledge-based Question Answering Approach
In this paper, we present an approach which, given a knowledge base and an appropriate text corpus, automatically induces patterns which can be used to query the knowledge base. W...
Philipp Cimiano, Michael Erdmann, Günter Ladw...
ICAS
2008
IEEE
190views Robotics» more  ICAS 2008»
16 years 1 months ago
A Survey of Context Adaptation in Autonomic Computing
—Autonomic Computing (AC) is an emerging paradigm aiming at simplifying the administration of complex computer systems. Efforts required to deploy and maintain complex systems ar...
Cornel Klein, Reiner N. Schmid, Christian Leuxner,...
MFCS
2009
Springer
15 years 11 months ago
Time-Bounded Kolmogorov Complexity and Solovay Functions
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
Rupert Hölzl, Thorsten Kräling, Wolfgang...