1941 search results - page 141 / 389 » On the Hardness of Approximate Reasoning |
172
click to vote
ASIACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
172
click to vote
ICC
2008
IEEE
16 years 27 days ago
2008
IEEE
—In this paper, we propose an iterative joint DA/DD channel estimation algorithm for known symbol padding (KSP) OFDM. The pilot symbols used to estimate the channel are not only ...
170
click to vote
FOCS
2005
IEEE
16 years 1 days ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
159
click to vote
CODES
1998
IEEE
15 years 10 months ago
1998
IEEE
Timing analysis for checking satisfaction of constraints is a crucial problem in real-time system design. In some current approaches, the delay of software modules is precalculate...
158
click to vote
ICVGIP
2004
15 years 7 months ago
2004
Most fingerprint matching systems are based on matching minutia points between two fingerprint images. Each minutia is represented by a fixed number of attributes such as the loca...