Sciweavers

6251 search results - page 36 / 1251
» Randomness, Computability, and Density
Sort
View
AVI
2006
15 years 4 months ago
Just how dense are dense graphs in the real world?: a methodological note
This methodological note focuses on the edge density of real world examples of networks. The edge density is a parameter of interest typically when putting up user studies in an e...
Guy Melançon
122
Voted
ICCV
2007
IEEE
16 years 5 months ago
Finite-Element Level-Set Curve Particles
Particle filters encode a time-evolving probability density by maintaining a random sample from it. Level sets represent closed curves as zero crossings of functions of two variab...
Tingting Jiang, Carlo Tomasi
ECCV
2000
Springer
16 years 5 months ago
A Probabilistic Background Model for Tracking
A new probabilistic background model based on a Hidden Markov Model is presented. The hidden states of the model enable discrimination between foreground, background and shadow. Th...
Jens Rittscher, Jien Kato, Sébastien Joga, ...
SAT
2007
Springer
99views Hardware» more  SAT 2007»
15 years 9 months ago
Horn Upper Bounds and Renaming
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
Marina Langlois, Robert H. Sloan, György Tur&...