Results 1  10
of
195,519
Uncertainty principles and ideal atomic decomposition
 IEEE Transactions on Information Theory
, 2001
"... Suppose a discretetime signal S(t), 0 t<N, is a superposition of atoms taken from a combined time/frequency dictionary made of spike sequences 1ft = g and sinusoids expf2 iwt=N) = p N. Can one recover, from knowledge of S alone, the precise collection of atoms going to make up S? Because every d ..."
Abstract

Cited by 578 (20 self)
 Add to MetaCart
discretetime signal can be represented as a superposition of spikes alone, or as a superposition of sinusoids alone, there is no unique way of writing S as a sum of spikes and sinusoids in general. We prove that if S is representable as a highly sparse superposition of atoms from this time
DeNoising By SoftThresholding
, 1992
"... Donoho and Johnstone (1992a) proposed a method for reconstructing an unknown function f on [0; 1] from noisy data di = f(ti)+ zi, iid i =0;:::;n 1, ti = i=n, zi N(0; 1). The reconstruction fn ^ is de ned in the wavelet domain by translating all the empirical wavelet coe cients of d towards 0 by an a ..."
Abstract

Cited by 1248 (14 self)
 Add to MetaCart
Donoho and Johnstone (1992a) proposed a method for reconstructing an unknown function f on [0; 1] from noisy data di = f(ti)+ zi, iid i =0;:::;n 1, ti = i=n, zi N(0; 1). The reconstruction fn ^ is de ned in the wavelet domain by translating all the empirical wavelet coe cients of d towards 0
Keying hash functions for message authentication
, 1996
"... The use of cryptographic hash functions like MD5 or SHA for message authentication has become a standard approach inmanyInternet applications and protocols. Though very easy to implement, these mechanisms are usually based on ad hoc techniques that lack a sound security analysis. We present new cons ..."
Abstract

Cited by 605 (39 self)
 Add to MetaCart
of the underlying hash function. In addition our schemes are e cient and practical. Their performance is essentially that of the underlying hash function. Moreover they use the hash function (or its compression function) as a black box, so that widely available library code or hardware can be used to implement them
Neurofuzzy modeling and control
 IEEE Proceedings
, 1995
"... Abstract  Fundamental and advanced developments in neurofuzzy synergisms for modeling and control are reviewed. The essential part of neurofuzzy synergisms comes from a common framework called adaptive networks, which uni es both neural networks and fuzzy models. The fuzzy models under the framew ..."
Abstract

Cited by 231 (1 self)
 Add to MetaCart
Abstract  Fundamental and advanced developments in neurofuzzy synergisms for modeling and control are reviewed. The essential part of neurofuzzy synergisms comes from a common framework called adaptive networks, which uni es both neural networks and fuzzy models. The fuzzy models under the framework of adaptive networks is called ANFIS (AdaptiveNetworkbased Fuzzy Inference System), which possess certain advantages over neural networks. We introduce the design methods for ANFIS in both modeling and control applications. Current problems and future directions for neurofuzzy approaches are also addressed. KeywordsFuzzy logic, neural networks, fuzzy modeling, neurofuzzy modeling, neurofuzzy control, ANFIS. I.
On the Bahaduref cient testing of uniformity by means of the entropy
 IEEE Trans. Inform Theory
, 2008
"... Abstract — This paper compares the power divergence statistics of orders> 1 with the information divergence statistic in the problem of testing the uniformity of a distribution. In this problem the information divergence statistic is equivalent to the entropy statistic. Extending some previously ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
established results about information diagrams, it is proved that the information divergence statistic in this problem is more ef cient in the Bahadur sense than any power divergence statistic of order> 1: This means that the entropy provides in this sense the most ef cient way of characterizing
The market for corporate control: The empirical evidence since 1980
 Journal of Economic Perspectives
, 1988
"... Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at ..."
Abstract

Cited by 209 (4 self)
 Add to MetaCart
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at
Discovering Local Structure in Gene Expression Data: The OrderPreserving Submatrix Problem
, 2002
"... This paper concerns the discovery of patterns in gene expression matrices, in which each element gives the expression level of a given gene in a given experiment. Most existing methods for pattern discovery in such matrices are based on clustering genes by comparing their expression levels in all ex ..."
Abstract

Cited by 182 (1 self)
 Add to MetaCart
in the progress of a disease or in a cellular process and the expression levels of all genes in G vary across the stages in the same way. We de � ne a probabilistic model in which an OPSM is hidden within an otherwise random matrix. Guided by this model, we develop an ef � cient algorithm for � nding the hidden
Okapi at TREC4
 In Proceedings of the 4th Text REtrieval Conference (TREC4
, 1996
"... Introduction Okapi at TRECs 2 and 3 During TRECs 2 and 3 # the new termweighting functions were developed and re#ned as described in #1, Section 3.2# # a method of runtime passage determination and searching was devised #1, Section 4#; # an ine#cient but surprisingly e#ective way of choosing r ..."
Abstract

Cited by 178 (1 self)
 Add to MetaCart
Introduction Okapi at TRECs 2 and 3 During TRECs 2 and 3 # the new termweighting functions were developed and re#ned as described in #1, Section 3.2# # a method of runtime passage determination and searching was devised #1, Section 4#; # an ine#cient but surprisingly e#ective way of choosing
DecisionMaking in an Embedded Reasoning System
"... The development of reasoning systems that can reason and plan in a continuously changing environment is emerging as an important area of research in Artificial Intelligence. This paper describes some of the features of a Procedural Reasoning System (PRS) that enables it to operate e ectively in such ..."
Abstract

Cited by 194 (9 self)
 Add to MetaCart
The development of reasoning systems that can reason and plan in a continuously changing environment is emerging as an important area of research in Artificial Intelligence. This paper describes some of the features of a Procedural Reasoning System (PRS) that enables it to operate e ectively in such environments. The basic system design is first described and it is shown how this architecture supports both goaldirected reasoning and the ability toreact rapidly to unanticipated changes in the environment. The decisionmaking capabilities of the system are then discussed and it is indicated how the system integrates these components in a manner that takes account of the bounds on both resources and knowledge that typify most realtime operations. The system has been applied to handling malfunctions on the space shuttle, threat assessment, and the control of an autonomous robot.
Results 1  10
of
195,519