10988 search results - page 295 / 2198 » Algorithmic Folding Complexity |
139
click to vote
CORR
2010
Springer
15 years 4 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 ...
120
click to vote
ECCC
2008
15 years 4 months ago
2008
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
176
click to vote
TIP
2008
15 years 4 months ago
2008
A method for removing additive Gaussian noise from digital images is described. It is based on statistical modeling of the coefficients of a redundant, oriented, complex multiscale...
127
click to vote
TON
2008
15 years 4 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
133
click to vote
TSMC
2008
15 years 4 months ago
2008
Testing complex manufacturing systems, such as an ASML [1] lithographic machine, takes up to 45% of the total development time of a system. The problem of which tests must be execu...