We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
This paper presents a brief summary of the findings of a Web-based survey of the views of Australian publishers, on the potential impact of digital technologies, followed by three...
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
Abstract. In this paper we describe a number of experiments relating to PCAbased palmprint and face recognition. The experiments were designed to determine the influence of differe...
: Most online help systems on the market prove unsuited to the actual needs of novice users. Although recent research has focused on the design and implementation of contextual, ad...