Sciweavers

17541 search results - page 3151 / 3509
» Complexity in scalable computing
Sort
View
JSCIC
2007
89views more  JSCIC 2007»
15 years 6 months 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
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
15 years 6 months ago
The Hausdorff Voronoi Diagram of Point Clusters in the Plane
We study the Hausdorff Voronoi diagram of point clusters in the plane, a generalization of Voronoi diagrams based on the Hausdorff distance function. We derive a tight combinatori...
Evanthia Papadopoulou
JUCS
2007
91views more  JUCS 2007»
15 years 6 months ago
Generative Instructional Engineering of Competence Development Programmes
: Competence development programmes are collections of units of learning and learning activities used to increase the overall effective performance of a learner within a certain ta...
Juan Manuel Dodero, Salvador Sánchez Alonso...
JVCA
2007
128views more  JVCA 2007»
15 years 6 months ago
Impulse-based dynamic simulation in linear time
This paper describes an impulse-based dynamic simulation method for articulated bodies which has a linear time complexity. Existing linear-time methods are either based on a reduc...
Jan Bender
TWC
2008
150views more  TWC 2008»
15 years 6 months ago
Design and analysis of post-coded OFDM systems
This paper discusses the design and analysis of post coded OFDM (PC-OFDM) systems. Coded or precoded OFDM systems are generally employed to overcome the symbol recovery problem in...
S. F. A. Shah, Ahmed H. Tewfik
« Prev « First page 3151 / 3509 Last » Next »