5138 search results - page 914 / 1028 » Randomized Algorithms for 3-SAT |
118
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
149
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for acquisition of sparse or compressible signals that can be well approximated by just K N elements from a...
118
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
123
click to vote
ESWA
2008
15 years 2 months ago
2008
In this paper a novel complex classifier architecture is proposed. The architecture has a hierarchical tree-like structure with simple artificial neural networks (ANNs) at each no...