2370 search results - page 453 / 474 » The Characterization of Data-Accumulating Algorithms |
ACISP
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
EMO
2001
Springer
14 years 2 months ago
2001
Springer
One common characterization of how simple hill-climbing optimization methods can fail is that they become trapped in local optima - a state where no small modi cation of the curren...
MOBICOM
2000
ACM
14 years 2 months ago
2000
ACM
An on-demand routing protocol for wireless ad hoc networks is one that searches for and attempts to discover a route to some destination node only when a sending node originates a...
SIGGRAPH
1999
ACM
14 years 2 months ago
1999
ACM
We present a solution to the general problem of characterizing shadows in scenes involving a uniform polygonal area emitter and a polygonal occluder in arbitrary position by manif...
IDEAS
1999
IEEE
14 years 1 months ago
1999
IEEE
An object database management system (OODBMS) has been often criticized for its alleged insufficient scalability for a large-scale production system. We investigated the scalabili...