644 search results - page 46 / 129 » Decomposition Complexity |
127
Voted
AI
2003
Springer
15 years 7 months ago
2003
Springer
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...
175
Voted
AAAI
2011
14 years 2 months ago
2011
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
125
Voted
AMW
2009
15 years 12 days ago
2009
We address schema design in uncertain databases. Since uncertain data is relational in nature, decomposition becomes a key issue in design. Decomposition relies on dependency theo...
134
Voted
COCO
2003
Springer
15 years 7 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
137
Voted
CMSB
2008
Springer
15 years 4 months ago
2008
Springer
Kinetic models for biochemical systems often comprise a large amount of coupled differential equations with species concentrations varying on different time scales. In this paper w...