6142 search results - page 233 / 1229 » The Complexity of Partition Functions |
121
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...
135
click to vote
ICPR
2004
IEEE
16 years 6 months ago
2004
IEEE
A new criterion based on Gaussian fields is introduced and applied to the task of automatic rigid registration of point-sets. The method defines a simple energy function, which is...
151
click to vote
ICRA
2008
IEEE
15 years 11 months ago
2008
IEEE
— In this paper we present a polynomial Navigation Function (NF) for a sphere world that can be constructed almost locally, with partial knowledge of the environment. The present...
121
Voted
ITC
1998
IEEE
15 years 9 months ago
1998
IEEE
New methodologies based on functional testing and built-in self-test can narrow the gap between necessary solutions and existing techniques for processor validation and testing. W...
138
Voted
CRYPTO
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Since Crypto 2004, hash functions have been the target of many attacks which showed that several well-known functions such as SHA-0 or MD5 can no longer be considered sec...