827 search results - page 19 / 166 » The Complexity of Probabilistic Lobbying |
102
click to vote
NAACL
2003
15 years 3 months ago
2003
Large-scale parsing is still a complex and timeconsuming process, often so much that it is infeasible in real-world applications. The parsing system described here addresses this ...
146
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
We present a framework for the automatic recognition of complex multi-agent events in settings where structure is imposed by rules that agents must follow while performing activit...
118
Voted
CIKM
2011
Springer
14 years 1 months ago
2011
Springer
A growing number of applications are built on top of search engines and issue complex structured queries. This paper contributes a customisable ranking-based processing of such qu...
107
Voted
CCGRID
2003
IEEE
15 years 7 months ago
2003
IEEE
— Due to enormous complexity of the unstructured peer-to-peer networks as large-scale, self-configure, and dynamic systems, the models used to characterize these systems are eit...
112
click to vote
CPC
1998
15 years 1 months ago
1998
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...