2767 search results - page 68 / 554 » Universal Exponentiation Algorithm |
SODA
2012
ACM
13 years 8 days ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
FORMATS
2007
Springer
15 years 4 months ago
2007
Springer
Timed automata were introduced by Alur and Dill in the early 1990s and have since become the most prominent modelling formalism for real-time systems. A fundamental limit to the al...
CEC
2007
IEEE
15 years 1 months ago
2007
IEEE
Combinations of evolutionary based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of such a...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...
JMM2
2007
14 years 9 months ago
2007
Abstract— In this paper, we present a novel universal approach which consists in exploring statistics in the compressed frequency domain. This approach is motivated by two main c...