4539 search results - page 707 / 908 » Approaches to Compute Workflow Complexity |
133
click to vote
COLING
2010
15 years 1 months ago
2010
Dative variation is a widely observed syntactic phenomenon in world languages (e.g. I gave John a book and I gave a book to John). It has been shown that which surface form will b...
201
click to vote
TCS
2010
15 years 1 months ago
2010
Markovian process algebras, such as PEPA and stochastic -calculus, bring a powerful compositional approach to the performance modelling of complex systems. However, the models gen...
173
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we address invariant keypoint-based texture characterization and recognition. Viewing keypoint sets associated with visual textures as realizations of point process...
171
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
233
click to vote
AAAI
2011
14 years 6 months ago
2011
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...