258 search results - page 26 / 52 » Some Notes on Fine Computability |
138
click to vote
ISBI
2008
IEEE
16 years 6 months ago
2008
IEEE
Growth and form in biology are often associated with some level of fractality. Fractal characteristics have also been noted in a number of imaging modalities. These observations m...
130
click to vote
LICS
2008
IEEE
16 years 9 days ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
151
click to vote
CIE
2005
Springer
15 years 11 months ago
2005
Springer
• We produce a classification of the pointclasses of sets of reals produced by infinite time turing machines with 1-tape. The reason for choosing this formalism is that it appa...
151
click to vote
PKC
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we first introduce a new kind of adversarial goal called forge-and-impersonate in undeniable signature schemes. Note that forgeability does not necessarily imply im...
120
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In [Spi], we developed a category of databases in which the schema of a database is represented as a simplicial set. Each simplex corresponds to a table in the database. There, our...