Sciweavers

1772 search results - page 213 / 355
» Classifying Problems into Complexity Classes
Sort
View
135
Voted
CVPR
2009
IEEE
16 years 7 months ago
Locally Time-Invariant models of Human Activities using Trajectories on the Grassmanian
Human activity analysis is an important problem in computer vision with applications in surveillance and summarization and indexing of consumer content. Complex human activities...
Pavan Turaga, Rama Chellappa
EDBTW
2010
Springer
15 years 7 months ago
Updating probabilistic XML
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...
Evgeny Kharlamov, Werner Nutt, Pierre Senellart
121
Voted
EDBT
2004
ACM
155views Database» more  EDBT 2004»
16 years 26 days ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
ATAL
2009
Springer
15 years 7 months ago
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
Akshat Kumar, Shlomo Zilberstein
111
Voted
AI
2003
Springer
15 years 6 months ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin