Sciweavers

15073 search results - page 5 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
SAC
2006
ACM
15 years 3 months ago
Interval-based robust statistical techniques for non-negative convex functions, with application to timing analysis of computer
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
Michael Orshansky, Wei-Shen Wang, Martine Ceberio,...
CORR
1998
Springer
135views Education» more  CORR 1998»
14 years 9 months ago
The Computational Complexity of Probabilistic Planning
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
Michael L. Littman, Judy Goldsmith, Martin Mundhen...
TCS
2008
14 years 9 months ago
Computation of distances for regular and context-free probabilistic languages
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
Mark-Jan Nederhof, Giorgio Satta
ISWC
1997
IEEE
15 years 1 months ago
Stochasticks: Augmenting the Billiards Experience with Probabilistic Vision and Wearable Computers
We propose a practical application of wearable computing and augmented reality which enhances the game of billiards. A vision algorithm is implemented which operates in interactiv...
Tony Jebara, Cyrus Eyster, Joshua Weaver, Thad Sta...
SIGIR
2010
ACM
14 years 9 months ago
Optimal meta search results clustering
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
Claudio Carpineto, Giovanni Romano