2465 search results - page 245 / 493 » Automata on Linear Orderings |
104
Voted
PPL
2000
15 years 15 days ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
80
Voted
SIAMSC
2010
14 years 11 months ago
2010
This paper constructs extrapolated implicit-explicit time stepping methods that allow one to efficiently solve problems with both stiff and nonstiff components. The proposed meth...
123
Voted
LICS
2010
IEEE
14 years 10 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
110
Voted
BMCBI
2010
15 years 26 days ago
2010
Background: Novel strategies are required in order to handle the huge amount of data produced by microarray technologies. To infer gene regulatory networks, the first step is to f...
126
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...