Sciweavers

230 search results - page 46 / 46
» Practical Compact E-Cash
Sort
View
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
13 years 7 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka
IJFCS
2007
105views more  IJFCS 2007»
13 years 7 months ago
On the Existence of Lookahead Delegators for NFA
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
Bala Ravikumar, Nicolae Santean
AC
2005
Springer
13 years 7 months ago
The state of artificial intelligence
Artificial intelligence has been an active branch of research for computer scientists and psychologists for 50 years. The concept of mimicking human intelligence in a computer fue...
Adrian A. Hopgood
JAIR
2007
87views more  JAIR 2007»
13 years 7 months ago
Supporting Temporal Reasoning by Mapping Calendar Expressions to Minimal Periodic Sets
In the recent years several research efforts have focused on the concept of time granularity and its applications. A first stream of research investigated the mathematical model...
Claudio Bettini, Sergio Mascetti, Xiaoyang Sean Wa...
JMIV
2007
143views more  JMIV 2007»
13 years 7 months ago
Measures for Benchmarking of Automatic Correspondence Algorithms
Automatic localisation of correspondences for the construction of Statistical Shape Models from examples has been the focus of intense research during the last decade. Several alg...
Anders Ericsson, Johan Karlsson