Sciweavers

2520 search results - page 320 / 504
» The complexity of approximating entropy
Sort
View
FSTTCS
2006
Springer
15 years 10 months ago
Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
Abstract. In this paper we construct fixed finite tile systems that assemble into particular classes of shapes. Moreover, given an arbitrary n, we show how to calculate the tile co...
Florent Becker, Ivan Rapaport, Eric Rémila
ISPD
1998
ACM
99views Hardware» more  ISPD 1998»
15 years 10 months ago
New efficient algorithms for computing effective capacitance
We describe a novel iterationless approach for computing the effective capacitance of an interconnect load at a driving gate output. Our new approach is considerably faster than p...
Andrew B. Kahng, Sudhakar Muddu
RT
2000
Springer
15 years 10 months ago
Wavelet Radiosity on Arbitrary Planar Surfaces
Abstract. Wavelet radiosity is, by its nature, restricted to parallelograms or triangles. This paper presents an innovative technique enabling wavelet radiosity computations on pla...
Nicolas Holzschuch, François Cuny, Laurent ...
ICIP
1995
IEEE
15 years 10 months ago
Multigrid adaptive image processing
We consider a general weighted least squares approximation problem with a membrane spline regularization term. The key parameters in this formulation are the weighting factors whi...
Michael Unser
GLOBECOM
2009
IEEE
15 years 9 months ago
Localization Using Radial Basis Function Networks and Signal Strength Fingerprints in WLAN
Abstract—Fingerprinting localization techniques provide reliable location estimates and enable the development of location aware applications especially for indoor environments, ...
Christos Laoudias, Paul Kemppi, Christos G. Panayi...