Sciweavers

4377 search results - page 289 / 876
» Mass problems and randomness
Sort
View
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
16 years 1 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
161
Voted
DEXA
2009
Springer
177views Database» more  DEXA 2009»
16 years 1 months ago
A Versatile Record Linkage Method by Term Matching Model Using CRF
We solve the problem of record linkage between databases where record fields are mixed and permuted in different ways. The solution method uses a conditional random fields model...
Quang Minh Vu, Atsuhiro Takasu, Jun Adachi
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
16 years 1 months ago
Discrete dynamical genetic programming in XCS
A number of representation schemes have been presented for use within Learning Classifier Systems, ranging from binary encodings to neural networks. This paper presents results fr...
Richard Preen, Larry Bull
CISS
2008
IEEE
16 years 1 months ago
Distributed estimation in wireless sensor networks via variational message passing
Abstract – In this paper, a variational message passing framework is proposed for Markov random fields. Analogous to the traditional belief propagation algorithm, variational mes...
Yanbing Zhang, Huaiyu Dai
ICASSP
2008
IEEE
16 years 1 months ago
A compressive beamforming method
Compressive Sensing (CS) is an emerging area which uses a relatively small number of non-traditional samples in the form of randomized projections to reconstruct sparse or compres...
Ali Cafer Gurbuz, James H. McClellan, Volkan Cevhe...