Sciweavers

10054 search results - page 304 / 2011
» On the Complexity of Function Learning
Sort
View
137
Voted
IM
2007
15 years 3 months ago
Pursuit-Evasion in Models of Complex Networks
Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
Anthony Bonato, Pawel Pralat, Changping Wang
76
Voted
TIT
2008
51views more  TIT 2008»
15 years 3 months ago
Spectral Relations for Multidimensional Complex Improper Stationary and (Almost) Cyclostationary Processes
Abstract--We study continuous-time multidimensional widesense stationary (WSS) and (almost) cyclostationary processes in the frequency domain. Under the assumption that the correla...
Patrik Wahlberg, Peter J. Schreier
172
Voted
AMC
2011
14 years 10 months ago
Complexity reduction of C-Algorithm
This is a companion paper of [1] and [2]. In the cited papers, using the C-algorithm introduced in [3], many new examples of isochronous centers for Li´enard type equation are fou...
Magali Bardet, Islam Boussaada
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
15 years 7 months ago
Improving GP classifier generalization using a cluster separation metric
Genetic Programming offers freedom in the definition of the cost function that is unparalleled among supervised learning algorithms. However, this freedom goes largely unexploited...
Ashley George, Malcolm I. Heywood
BLISS
2009
IEEE
15 years 4 months ago
Autonomous Physical Secret Functions and Clone-Resistant Identification
Self configuring VLSI technology architectures offer a new environment for creating novel security functions. Two such functions for physical security architectures are proposed t...
Wael Adi