Sciweavers

807 search results - page 118 / 162
» Competition Adds Complexity
Sort
View
103
Voted
TSP
2008
114views more  TSP 2008»
15 years 13 days ago
Universal Switching Linear Least Squares Prediction
We consider sequential regression of individual sequences under the square error loss. Using a competitive algorithm framework, we construct a sequential algorithm that can achieve...
Suleyman Serdar Kozat, Andrew C. Singer
JSCIC
2007
89views more  JSCIC 2007»
15 years 13 days ago
Adjoint Recovery of Superconvergent Linear Functionals from Galerkin Approximations. The One-dimensional Case
In this paper, we extend the adjoint error correction of Pierce and Giles [SIAM Review, 42 (2000), pp. 247-264] for obtaining superconvergent approximations of functionals to Gale...
Bernardo Cockburn, Ryuhei Ichikawa
CPHYSICS
2004
85views more  CPHYSICS 2004»
15 years 11 days ago
Beyond benchmarking - how experiments and simulations can work together in plasma physics
There has been dramatic progress in the scope and power of plasma simulations in recent years; and because codes are generally cheaper to write, to run and to diagnose than experi...
Martin Greenwald
111
Voted
CG
2002
Springer
15 years 11 days ago
Analytical methods for polynomial weighted convolution surfaces with various kernels
Convolution surface has the advantage of being crease-free and bulge-free over other kinds of implicit surfaces. Among the various types of skeletal elements, line segments can be...
Xiaogang Jin, Chiew-Lan Tai
112
Voted
ECCC
2000
158views more  ECCC 2000»
15 years 11 days ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass