724 search results - page 106 / 145 » Some Structural Complexity Aspects of Neural Computation |
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
108
click to vote
ICNP
2006
IEEE
15 years 3 months ago
2006
IEEE
— Peer-to-peer (P2P) systems have been widely used for exchange of voluminous information and resources among thousands or even millions of users. Since shared data are normally ...
CAD
2005
Springer
14 years 9 months ago
2005
Springer
CAD has been traditionally used to assist in engineering design and modeling for representation, analysis and manufacturing. Advances in Information Technology and in Biomedicine ...
DLOG
2010
14 years 7 months ago
2010
Abstract. Abductive reasoning has been recognized as a valuable complement to deductive inference for tasks such as diagnosis and integration of incomplete information despite its ...
103
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...