Sciweavers

436 search results - page 80 / 88
» Multi-Objective Probability Collectives
Sort
View
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
15 years 1 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes
SIGIR
2010
ACM
15 years 1 months ago
Proximity-based opinion retrieval
Blog post opinion retrieval aims at finding blog posts that are relevant and opinionated about a user’s query. In this paper we propose a simple probabilistic model for assigni...
Shima Gerani, Mark James Carman, Fabio Crestani
DASFAA
2009
IEEE
253views Database» more  DASFAA 2009»
15 years 1 months ago
Implementing and Optimizing Fine-Granular Lock Management for XML Document Trees
Abstract. Fine-grained lock protocols with lock modes and lock granules adjusted to the various XML processing models, allow for highly concurrent transaction processing on XML tre...
Sebastian Bächle, Theo Härder, Michael P...
AAAI
2008
15 years 1 days ago
CIGAR: Concurrent and Interleaving Goal and Activity Recognition
In artificial intelligence and pervasive computing research, inferring users' high-level goals from activity sequences is an important task. A major challenge in goal recogni...
Derek Hao Hu, Qiang Yang
MSR
2010
ACM
14 years 11 months ago
Identifying security bug reports via text mining: An industrial case study
-- A bug-tracking system such as Bugzilla contains bug reports (BRs) collected from various sources such as development teams, testing teams, and end users. When bug reporters subm...
Michael Gegick, Pete Rotella, Tao Xie