5101 search results - page 420 / 1021 » Capturing Context Requirements |
163
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...
197
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
180
click to vote
DASFAA
2009
IEEE
16 years 1 months ago
2009
IEEE
Recently, due to its wide applications, (similar) subgraph search has attracted a lot of attentions from database and data mining community, such as [13, 18, 19, 5]. In [8], Ke et ...
180
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
Formalization is a necessary precondition for the specification of precise and unambiguous use case models, which serve as reference points for the design and implementation of so...
208
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
The number of computational trust models has been increasing rapidly in recent years, yet their applications for automating trust evaluation are still limited. The main obstacle i...