Sciweavers

1414 search results - page 236 / 283
» Randomness and Universal Machines
Sort
View
COLT
2004
Springer
14 years 3 months ago
Learning a Hidden Graph Using O(log n) Queries Per Edge
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
Dana Angluin, Jiang Chen
SBIA
2004
Springer
14 years 3 months ago
Learning with Class Skews and Small Disjuncts
One of the main objectives of a Machine Learning – ML – system is to induce a classifier that minimizes classification errors. Two relevant topics in ML are the understanding...
Ronaldo C. Prati, Gustavo E. A. P. A. Batista, Mar...
SPAA
2003
ACM
14 years 3 months ago
Asynchronous parallel disk sorting
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
Roman Dementiev, Peter Sanders
BIRTHDAY
2003
Springer
14 years 3 months ago
Computational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
Krishna V. Palem
COLT
2003
Springer
14 years 3 months ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan