Sciweavers

2520 search results - page 52 / 504
» The complexity of approximating entropy
Sort
View
ESANN
2007
15 years 1 months ago
Controlling complexity of RBF networks by similarity
Abstract. Using radial basis function networks for function approximation tasks suffers from unavailable knowledge about an adequate network size. In this work, a measuring techni...
Ulrich Rückert, Ralf Eickhoff
93
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
Power Controlled Scheduling with Consecutive Transmission Constraints: Complexity Analysis and Algorithm Design
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
Liqun Fu, Soung Chang Liew, Jianwei Huang
101
Voted
DASFAA
2005
IEEE
136views Database» more  DASFAA 2005»
15 years 6 months ago
Distributed Intersection Join of Complex Interval Sequences
In many different application areas, e.g. space observation systems or engineering systems of world-wide operating companies, there is a need for an efficient distributed intersect...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
105
Voted
AMC
2005
112views more  AMC 2005»
15 years 11 days ago
Stieltjes moment problem via fractional moments
Stieltjes moment problem is considered to recover a probability density function from the knowledge of its infinite sequence of ordinary moments. The approximate density is obtain...
Pierluigi Novi Inverardi, Alberto Petri, Giorgio P...
90
Voted
FUIN
2006
88views more  FUIN 2006»
15 years 14 days ago
Calculi of Approximation Spaces
This paper considers the problem of how to establish calculi of approximation spaces. Approximation spaces considered in the context of rough sets were introduced by Zdzislaw Pawla...
Andrzej Skowron, Jaroslaw Stepaniuk, James F. Pete...