Sciweavers

2477 search results - page 245 / 496
» Approximate extended formulations
Sort
View
IJCNN
2006
IEEE
16 years 21 days ago
Bi-directional Modularity to Learn Visual Servoing Tasks
— This paper shows the advantage of using neural network modularity over conventional learning schemes to approximate complex functions. Indeed, it is difficult for artificial ...
Gilles Hermann, Patrice Wira, Jean-Philippe Urban
INFOCOM
2006
IEEE
16 years 21 days ago
A Statistical Framework for Intrusion Detection in Ad Hoc Networks
— We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically fail to detect attacks and also gener...
Dhanant Subhadrabandhu, Saswati Sarkar, Farooq Anj...
CEC
2005
IEEE
16 years 9 days ago
XCS with computed prediction for the learning of Boolean functions
Computed prediction represents a major shift in learning classifier system research. XCS with computed prediction, based on linear approximators, has been applied so far to functi...
Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wils...
ISAAC
2004
Springer
117views Algorithms» more  ISAAC 2004»
16 years 1 days ago
Adaptive Spatial Partitioning for Multidimensional Data Streams
We propose a space-efficient scheme for summarizing multidimensional data streams. Our sketch can be used to solve spatial versions of several classical data stream queries effici...
John Hershberger, Nisheeth Shrivastava, Subhash Su...
STOC
2003
ACM
109views Algorithms» more  STOC 2003»
15 years 12 months ago
A new multilayered PCP and the hardness of hypergraph vertex cover
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
Irit Dinur, Venkatesan Guruswami, Subhash Khot, Od...