Sciweavers

8795 search results - page 1470 / 1759
» Measuring Generality of Documents
Sort
View
ALGORITHMICA
1998
90views more  ALGORITHMICA 1998»
15 years 5 months ago
Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators
We provide here a complete average-case analysis of the binary continued fraction representation of a random rational whose numerator and denominator are odd and less than N. We an...
Brigitte Vallée
IJRR
2002
159views more  IJRR 2002»
15 years 5 months ago
Mapping Partially Observable Features from Multiple Uncertain Vantage Points
This paper presents a technique for mapping partially observable features from multiple uncertain vantage points. The problem of concurrent mapping and localization (CML) is state...
John J. Leonard, Richard J. Rikoski, Paul M. Newma...
CORR
1999
Springer
93views Education» more  CORR 1999»
15 years 5 months ago
Empirically Evaluating an Adaptable Spoken Dialogue System
Abstract. Recent technological advances have made it possible to build real-time, interactive spoken dialogue systems for a wide variety of applications. However, when users do not...
Diane J. Litman, Shimei Pan
SIGMETRICS
1998
ACM
15 years 5 months ago
Internet service performance failure detection
The increasing complexity of computer networks and our increasing dependence on them means enforcing reliability requirements is both more challenging and more critical. The expan...
Amy R. Ward, Peter W. Glynn, Kathy J. Richardson
TCS
1998
15 years 5 months ago
An Improved Zero-One Law for Algorithmically Random Sequences
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
Steven M. Kautz
« Prev « First page 1470 / 1759 Last » Next »