Sciweavers

12741 search results - page 257 / 2549
» Editorial and call for papers
Sort
View
STOC
2005
ACM
84views Algorithms» more  STOC 2005»
16 years 7 months ago
Learning nonsingular phylogenies and hidden Markov models
In this paper, we study the problem of learning phylogenies and hidden Markov models. We call the Markov model nonsingular if all transtion matrices have determinants bounded away...
Elchanan Mossel, Sébastien Roch
STOC
2002
ACM
124views Algorithms» more  STOC 2002»
16 years 7 months ago
Clairvoyant scheduling of random walks
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
Péter Gács
PERCOM
2008
ACM
16 years 6 months ago
Protecting Users' Anonymity in Pervasive Computing Environments
The large scale adoption of adaptive services in pervasive and mobile computing is likely to be conditioned to the availability of reliable privacy-preserving technologies. Unfort...
Linda Pareschi, Daniele Riboni, Claudio Bettini
PERCOM
2007
ACM
16 years 6 months ago
Pervasive Fabrication: Making Construction Ubiquitous in Education
The notion of "pervasive computing" has traditionally been identified with a focus on what might be called "pervasive processing". This paper, in contrast, argu...
Michael Eisenberg
PERCOM
2005
ACM
16 years 6 months ago
Media Distribution in a Pervasive Computing Environment
Distribution of media in the fast growing world of digital stored content and multimedia supporting devices with connectivity, calls for a new media distribution architecture. The...
Winfried A. H. Berkvens, Arjan Claassen, Joep P. v...