Sciweavers

415 search results - page 38 / 83
» Propagating functional dependencies with conditions
Sort
View
AICT
2007
IEEE
180views Communications» more  AICT 2007»
15 years 4 months ago
BPTraSha: A Novel Algorithm for Shaping Bursty Nature of Internet Traffic
Various researchers have reported that traffic measurements demonstrate considerable burstiness on several time scales, with properties of self-similarity. Also, the rapid developm...
Karim Mohammed Rezaul, Vic Grout
TSP
2008
151views more  TSP 2008»
14 years 9 months ago
Convergence Analysis of Reweighted Sum-Product Algorithms
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
Tanya Roosta, Martin J. Wainwright, Shankar S. Sas...
MOR
2006
60views more  MOR 2006»
14 years 9 months ago
Measure-Valued Differentiation for Stationary Markov Chains
: We study general state-space Markov chains that depend on a parameter, say, . Sufficient conditions are established for the stationary performance of such a Markov chain to be di...
Bernd Heidergott, Arie Hordijk, Heinz Weisshaupt
CORR
2006
Springer
135views Education» more  CORR 2006»
14 years 9 months ago
The Calculus of Algebraic Constructions
: This paper is concerned with the foundations of the Calculus of Algebraic Constructions (CAC), an extension of the Calculus of Constructions by inductive data types. CAC generali...
Frédéric Blanqui, Jean-Pierre Jouann...
CVPR
2009
IEEE
16 years 4 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...