3210 search results - page 431 / 642 » Secure Similarity Search |
183
click to vote
LPNMR
2001
Springer
15 years 11 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
162
click to vote
IUI
2010
ACM
15 years 11 months ago
2010
ACM
We propose the concept of research trails to help web users create and reestablish context across fragmented research processes without requiring them to explicitly structure and ...
166
click to vote
ICDAR
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper, we will present a comprehensive voting approach, taking entire layouts obtained from commercial OCR devices as input. Such a layout comprises segments of three kind...
258
click to vote
ASIACRYPT
1999
Springer
15 years 11 months ago
1999
Springer
This paper presents a weakness in the key schedule of the AES candidate HPC (Hasty Pudding Cipher). It is shown that for the HPC version with a 128-bit key, 1 in 256 keys is weak i...
178
click to vote
CHI
1998
ACM
15 years 10 months ago
1998
ACM
Reading frequently involves not just looking at words on a page, but also underlining, highlighting and commenting, either on the text or in a separate notebook. This combination ...