Sciweavers

2735 search results - page 152 / 547
» Comparing notions of randomness
Sort
View
IANDC
1998
72views more  IANDC 1998»
13 years 10 months ago
On the Modelling of Search in Theorem Proving - Towards a Theory of Strategy Analysis
We present a model for representing search in theorem proving. This model captures the notion of contraction, which has been central in some of the recent developments in theorem ...
Maria Paola Bonacina, Jieh Hsiang
DPHOTO
2009
137views Hardware» more  DPHOTO 2009»
13 years 8 months ago
Sensor information capacity and spectral sensitivities
In this paper, we numerically quantify the information capacity of a sensor, by examining the different factors than can limit this capacity, namely sensor spectral response, nois...
Frédéric Cao, Frederic Guichard, H. ...
ICASSP
2011
IEEE
13 years 2 months ago
Transient acoustic signal classification using joint sparse representation
In this paper, we present a novel joint sparse representation based method for acoustic signal classification with multiple measurements. The proposed method exploits the correla...
Haichao Zhang, Nasser M. Nasrabadi, Thomas S. Huan...
EC
2008
120views ECommerce» more  EC 2008»
13 years 10 months ago
Genetic Algorithms with Memory- and Elitism-Based Immigrants in Dynamic Environments
In recent years the genetic algorithm community has shown a growing interest in studying dynamic optimization problems. Several approaches have been devised. The random immigrants...
Shengxiang Yang
ICDE
2005
IEEE
118views Database» more  ICDE 2005»
14 years 11 months ago
A Framework for High-Accuracy Privacy-Preserving Mining
To preserve client privacy in the data mining process, a variety of techniques based on random perturbation of individual data records have been proposed recently. In this paper, ...
Shipra Agrawal, Jayant R. Haritsa