Sciweavers

1414 search results - page 168 / 283
» Randomness and Universal Machines
Sort
View
JACM
2000
73views more  JACM 2000»
15 years 3 months ago
Parallel RAMs with owned global memory and deterministic context-free language recognition
We identify and study a natural and frequently occurring subclass of Concurrent Read, Exclusive Write Parallel Random Access Machines (CREW-PRAMs). Called Concurrent Read, Owner Wr...
Patrick W. Dymond, Walter L. Ruzzo
167
Voted
EMNLP
2009
15 years 1 months ago
Graphical Models over Multiple Strings
We study graphical modeling in the case of stringvalued random variables. Whereas a weighted finite-state transducer can model the probabilistic relationship between two strings, ...
Markus Dreyer, Jason Eisner
143
Voted
ICML
2003
IEEE
16 years 4 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich
ICML
1999
IEEE
16 years 4 months ago
Abstracting from Robot Sensor Data using Hidden Markov Models
ing from Robot Sensor Data using Hidden Markov Models Laura Firoiu, Paul Cohen Computer Science Department, LGRC University of Massachusetts at Amherst, Box 34610 Amherst, MA 01003...
Laura Firoiu, Paul R. Cohen
128
Voted
ALT
2004
Springer
16 years 13 days ago
New Revision Algorithms
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...
Judy Goldsmith, Robert H. Sloan, Balázs Sz&...