Sciweavers

15073 search results - page 68 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
CVPR
2010
IEEE
15 years 11 months ago
Clustering Dynamic Textures with the Hierarchical EM Algorithm
The dynamic texture (DT) is a probabilistic generative model, defined over space and time, that represents a video as the output of a linear dynamical system (LDS). The DT model ...
Antoni Chan, Emanuele Coviello, Gert Lanckriet
FMCO
2006
Springer
15 years 6 months ago
Towards a Formal Framework for Computational Trust
d Abstract) Vladimiro Sassone1 , Karl Krukow2 , and Mogens Nielsen2 1 ECS, University of Southampton 2 BRICS , University of Aarhus We define a mathematical measure for the quantit...
Vladimiro Sassone, Karl Krukow, Mogens Nielsen
JCST
2010
189views more  JCST 2010»
14 years 10 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
CCR
2008
94views more  CCR 2008»
15 years 3 months ago
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
Xenofontas A. Dimitropoulos, Paul Hurley, Andreas ...
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 7 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic