8196 search results - page 146 / 1640 » Computational Modeling and Complexity Science |
159
click to vote
ER
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We investigate the computational complexity of reasoning over temporal extensions of conceptual data models. The temporal conceptual models we analyse include the standar...
156
click to vote
ICAI
2003
15 years 7 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
160
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
We describe a method of representing human activities that allows a collection of motions to be queried without examples, using a simple and effective query language. Our approach...
218
click to vote
CVPR
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper, we propose a generative model for representing complex motion, such as wavy river, dancing fire and dangling cloth. Our generative method consists of four component...
186
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
Videos usually consist of activities involving interactions between multiple actors, sometimes referred to as complex activities. Recognition of such activities requires modeling ...