Sciweavers

827 search results - page 14 / 166
» The Complexity of Probabilistic Lobbying
Sort
View
IPL
2006
99views more  IPL 2006»
15 years 1 months ago
Computational complexity of queries based on itemsets
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
Nikolaj Tatti
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
15 years 8 months ago
On the semantics and evaluation of top-k queries in probabilistic databases
We formulate three intuitive semantic properties for topk queries in probabilistic databases, and propose GlobalTopk query semantics which satisfies all of them. We provide a dyn...
Xi Zhang, Jan Chomicki
ICCV
2007
IEEE
16 years 3 months ago
Non-Parametric Probabilistic Image Segmentation
We propose a simple probabilistic generative model for image segmentation. Like other probabilistic algorithms (such as EM on a Mixture of Gaussians) the proposed model is princip...
Marco Andreetto, Lihi Zelnik-Manor, Pietro Perona
IPL
2011
91views more  IPL 2011»
14 years 5 months ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
92
Voted
JSS
2010
123views more  JSS 2010»
15 years 6 days ago
Timed Property Sequence Chart
—Probabilistic properties are considered as the most important requirements for a variety of software systems, since they are used to formulate extra-functional requirements such...
Pengcheng Zhang, Bixin Li, Lars Grunske