172 search results - page 28 / 35 » Improving the Time Complexity of Matsui's Linear Cryptanalys... |
111
click to vote
CP
2006
Springer
15 years 3 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
NETWORKING
2004
15 years 1 months ago
2004
In this paper we propose a new packet classification algorithm, which can substantially improve the performance of a classifier by decreasing the rulebase lookup latency. The algor...
INTERSPEECH
2010
14 years 6 months ago
2010
We extend our earlier work on deep-structured conditional random field (DCRF) and develop deep-structured hidden conditional random field (DHCRF). We investigate the use of this n...
130
click to vote
NIPS
2001
15 years 1 months ago
2001
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
126
click to vote
PODS
1995
ACM
15 years 3 months ago
1995
ACM
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...