Sciweavers

366 search results - page 38 / 74
» Four equivalent equivalences of reductions
Sort
View
127
Voted
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 26 days ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
IANDC
2008
84views more  IANDC 2008»
15 years 24 days ago
A theory of system behaviour in the presence of node and link failure
We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of D, a language in whi...
Adrian Francalanza, Matthew Hennessy
99
Voted
SIAMNUM
2010
150views more  SIAMNUM 2010»
14 years 7 months ago
Quasi-Optimal Convergence Rate of an Adaptive Discontinuous Galerkin Method
We analyze an adaptive discontinuous finite element method (ADFEM) for symmetric second order linear elliptic operators. The method is formulated on nonconforming meshes made of si...
Andrea Bonito, Ricardo H. Nochetto
TYPES
2004
Springer
15 years 6 months ago
A Few Constructions on Constructors
We present four constructions for standard equipment which can be generated for every inductive datatype: case analysis, structural recursion, no confusion, acyclicity. Our constru...
Conor McBride, Healfdene Goguen, James McKinna
78
Voted
JCDL
2003
ACM
94views Education» more  JCDL 2003»
15 years 6 months ago
Content Access Characterization in Digital Libraries
To support non-trivial clients, such as data exploration and analysis environments, digital libraries must be able to describe the access modes that their contents support. We pre...
Greg Janee, James Frew, David Valentine