Sciweavers

2520 search results - page 108 / 504
» The complexity of approximating entropy
Sort
View
ICASSP
2008
IEEE
15 years 4 months ago
Approximation and resampling of tapped delay line channel models with guaranteed channel properties
In this paper, we present a novel framework for resampling and complexity reduction of tapped delay line channel models. In contrast to related algorithms in this field, our fram...
Christian Mehlführer, Markus Rupp
WSCG
2001
202views more  WSCG 2001»
14 years 11 months ago
On Flexible Body Approximations of Rigid Body Dynamics
This paper demonstrates that techniques in flexible body dynamics can yield surprising results when applied to rigid bodies. The discussion presents a technique for constructing r...
John McDonald
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 25 days ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
LCTRTS
2000
Springer
15 years 1 months ago
Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems
The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler's admission tests and su...
Matteo Corti, Roberto Brega, Thomas R. Gross
CGF
2008
98views more  CGF 2008»
14 years 10 months ago
Surface Reconstruction from Unorganized Point Data with Quadrics
We present a reverse engineering method for constructing a surface approximation scheme whose input is a set of unorganized noisy points in space and whose output is a set of quad...
Marek Vanco, Bernd Hamann, Guido Brunnett