28888 search results - page 404 / 5778 » Computability and complexity in analysis |
154
click to vote
ISCAS
2003
IEEE
16 years 3 days ago
2003
IEEE
High frequency digital LSIs usually consist of many subcircuits coupled with multi-conductor interconnects embedded in the substrate. They sometimes cause serious problems of the ...
198
click to vote
ANTS
2010
Springer
15 years 10 months ago
2010
Springer
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
180
click to vote
AAAI
2008
15 years 9 months ago
2008
Automated generators for synthetic models and data can play a crucial role in designing new algorithms/modelframeworks, given the sparsity of benchmark models for empirical analys...
190
click to vote
DAGSTUHL
2004
15 years 8 months ago
2004
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
122
click to vote
ANLP
2000
15 years 8 months ago
2000
This paper introduces an approach to representing the kinds of information that components in a natural language generation (NLG) system will need to communicate to one another. T...