We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...
We discuss a Probably Approximate Correct (PAC) learning paradigm for Boolean formulas, which we call PAC meditation, where the class of formulas to be learnt is not known in advan...
Bruno Apolloni, Andrea Brega, Dario Malchiodi, Gio...
This work presents a performance modeling framework, developed by the Performance Modeling and Characterization (PMaC) Lab at the San Diego Supercomputer Center, that is faster tha...
Laura Carrington, Allan Snavely, Xiaofeng Gao, Nic...
Geophysics research has been faced with a growing need for automated techniques with which to process large quantities of data. A successful tool must meet a number of requirements...
Research on semantic search has become heated these years. In this paper we propose an approach focusing on searching for resources with descriptions. The knowledge representation ...