1998 search results - page 121 / 400 » Complexity of the Cover Polynomial |
162
click to vote
IMR
2007
Springer
16 years 17 days ago
2007
Springer
Unstructured hexahedral mesh generation is a critical part of the modeling process in the Spectral-Element Method (SEM). We present some examples of seismic wave propagation in co...
141
click to vote
IAT
2005
IEEE
16 years 1 days ago
2005
IEEE
Our previous research presents a methodology of cooperative problem solving for BDI systems, based on a complete formal theory. This covers both a static part, defining individua...
197
click to vote
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
271
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
187
click to vote
NIPS
2008
15 years 7 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...