Sciweavers

39 search results - page 3 / 8
» Characterizing History Independent Data Structures
Sort
View
JETAI
1998
110views more  JETAI 1998»
13 years 7 months ago
Independency relationships and learning algorithms for singly connected networks
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
Luis M. de Campos
DCC
2007
IEEE
14 years 7 months ago
Algorithms and Hardware Structures for Unobtrusive Real-Time Compression of Instruction and Data Address Traces
Instruction and data address traces are widely used by computer designers for quantitative evaluations of new architectures and workload characterization, as well as by software de...
Milena Milenkovic, Aleksandar Milenkovic, Martin B...
ALIFE
2008
13 years 7 months ago
Natural Selection in Relation to Complexity
, reproductive value, soft selectionAbstract Structural complexity characterizes our representations of dissipative structures. As a mechanistic concept, when referred to natural s...
Stanley N. Salthe
ICIP
2001
IEEE
14 years 9 months ago
Analysis of cloudy structures evolution on meteorological satellite acquisitions
This paper concerns the characterization of clouds on meteorological satellite image sequences through points trajectories. These temporal curves can be computed from the result o...
Dominique Béréziat, Isabelle Herlin,...
CSDA
2007
264views more  CSDA 2007»
13 years 7 months ago
Model-based methods to identify multiple cluster structures in a data set
Model-based clustering exploits finite mixture models for detecting group in a data set. It provides a sound statistical framework which can address some important issues, such as...
Giuliano Galimberti, Gabriele Soffritti