2681 search results - page 498 / 537 » Problem F |
APPROX
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
COCOON
2007
Springer
14 years 3 months ago
2007
Springer
We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between proof systems translate to reductions between the...
ER
2007
Springer
14 years 3 months ago
2007
Springer
There are a number of issues for information systems which are required to collect data urgently that are not well accommodated by current conceptual modelling methodologies and a...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
The brain has long been seen as a powerful analogy from which novel computational techniques could be devised. However, most artificial neural network approaches have ignored the...
ICANNGA
2007
Springer
14 years 3 months ago
2007
Springer
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...