4488 search results - page 342 / 898 » Focusing Search by Using Problem Solving Experience |
133
click to vote
CRYPTO
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we present a practical heuristic attack on the Ko, Lee et al. key exchange protocol introduced at Crypto 2000 [10]. One of the ideas behind our attack is using Dehorn...
126
click to vote
SIAMJO
2010
14 years 11 months ago
2010
Abstract. We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) problems from the perspective of approximate semismooth Newton methods. In ...
152
Voted
COMPGEOM
1995
ACM
15 years 8 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
155
Voted
ICCBR
2001
Springer
15 years 9 months ago
2001
Springer
It is useful for an intelligent software agent to be able to adapt to new demands from an environment. Such adaptation can be viewed as a redesign problem; an agent has some origin...
146
click to vote
IJCV
1998
15 years 4 months ago
1998
This paper formulates the optic flow problem as a set of over-determined simultaneous linear equations. It then introduces and studies two new robust optic flow methods. The fir...