Sciweavers

167 search results - page 19 / 34
» On the complexity and approximation of syntenic distance
Sort
View
DAC
2007
ACM
14 years 8 months ago
An Effective Guidance Strategy for Abstraction-Guided Simulation
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...
Flavio M. de Paula, Alan J. Hu
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
13 years 11 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
ECML
2007
Springer
14 years 1 months ago
Learning Balls of Strings with Correction Queries
When facing the question of learning languages in realistic settings, one has to tackle several problems that do not admit simple solutions. On the one hand, languages are usually...
Leonor Becerra-Bonache, Colin de la Higuera, Jean-...
IJCNN
2000
IEEE
13 years 12 months ago
Taxonomy of Neural Transfer Functions
The choice of transfer functions may strongly influence complexity and performance of neural networks used in classification and approximation tasks. A taxonomy of activation an...
Wlodzislaw Duch, Norbert Jankowski
CDC
2008
IEEE
110views Control Systems» more  CDC 2008»
13 years 9 months ago
Topological identification in networks of dynamical systems
The paper deals with the problem of reconstructing the tree-like topological structure of a network of linear dynamical systems. A distance function is defined in order to evaluat...
Donatello Materassi, Giacomo Innocenti