496 search results - page 51 / 100 » Machine models and lower bounds for query processing |
ALT
2004
Springer
14 years 4 months ago
2004
Springer
Different formal learning models address different aspects of learning. Below we compare learning via queries—interpreting learning as a one-shot process in which the learner i...
FPGA
1999
ACM
14 years 1 days ago
1999
ACM
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
CIAC
2006
Springer
13 years 11 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract-- A green code attempts to minimize the total energy per-bit required to communicate across a noisy channel. The classical information-theoretic approach neglects the ener...
PODC
2010
ACM
13 years 11 months ago
2010
ACM
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...