8298 search results - page 190 / 1660 » On the Complexity of Numerical Analysis |
186
click to vote
AIIA
2007
Springer
16 years 1 months ago
2007
Springer
Structured Hidden Markov Model (S-HMM) is a variant of Hierarchical Hidden Markov Model that shows interesting capabilities of extracting knowledge from symbolic sequences. In fact...
177
click to vote
DCC
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper derives bounds on the distortion rate function for quantization on the complex projective space denoted as CPn−1 . In essence the problem of quantization in an Euclid...
188
click to vote
SPAA
2003
ACM
16 years 11 days ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
181
click to vote
ICCSA
2003
Springer
16 years 10 days ago
2003
Springer
In this paper, we model an agent-based economy in which heterogeneous agents (firms and a bank) interact in the financial markets. The heterogeneity is due to the balance sheet ...
191
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...