Sciweavers

96 search results - page 6 / 20
» A Practical Estimation Method for Complex RE
Sort
View
JCST
2010
189views more  JCST 2010»
13 years 2 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
ICANN
1997
Springer
13 years 11 months ago
Topology Representing Networks for Intrinsic Dimensionality Estimation
Abstract. In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The rst one is a direct approach, w...
Jörg Bruske, Gerald Sommer
VTC
2008
IEEE
104views Communications» more  VTC 2008»
14 years 1 months ago
Low Complexity Acquisition of UWB Telemetry Data Packets with Clock Offset
—In this paper, low complexity acquisition of UWB telemetry data packets is addressed. In addition to the usual channel impairments considered of additive white Gaussian noise (A...
Saeed Khalesehosseini, John Nielsen
TIP
2002
169views more  TIP 2002»
13 years 7 months ago
On the origin of the bilateral filter and ways to improve it
Abstract--Additive noise removal from a given signal is an important problem in signal processing. Among the most appealing aspects of this field are the ability to refer it to a w...
Michael Elad
COLT
2010
Springer
13 years 5 months ago
Forest Density Estimation
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
Anupam Gupta, John D. Lafferty, Han Liu, Larry A. ...