Sciweavers

1730 search results - page 178 / 346
» Open Archiving for Open Research
Sort
View
ICML
1999
IEEE
15 years 11 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
83
Voted
CHI
2006
ACM
15 years 10 months ago
A continuous and objective evaluation of emotional experience with interactive play environments
Researchers are using emerging technologies to develop novel play environments, while established computer and console game markets continue to grow rapidly. Even so, evaluating t...
Regan L. Mandryk, M. Stella Atkins, Kori M. Inkpen
CHI
2006
ACM
15 years 10 months ago
Tableau machine: an alien presence in the home
Research in Ambient Intelligence and Ubiquitous Computing has put computational devices into many social settings while leaving intact much of the "task support and informati...
Mario Romero, Zachary Pousman, Michael Mateas
POPL
2008
ACM
15 years 10 months ago
A theory of contracts for web services
Contracts are behavioural descriptions of Web services. We devise a theory of contracts that formalises the compatibility of a client to a service, and the safe replacement of a s...
Giuseppe Castagna, Nils Gesbert, Luca Padovani
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
15 years 10 months ago
Byzantine agreement in the full-information model in O(log n) rounds
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan