5114 search results - page 60 / 1023 » Complex networks |
KDD
2002
ACM
14 years 9 months ago
2002
ACM
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
NETWORKS
2010
13 years 7 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
ECAL
2007
Springer
14 years 3 months ago
2007
Springer
The “order for free” exhibited by some classes of system has been exploited by natural selection in order to build systems capable of exhibiting complex behaviour. Here we expl...
COMGEO
2010
ACM
13 years 9 months ago
2010
ACM
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
ICANN
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. The growth in amount of data available today has encouraged the development of effective data analysis methods to support human decision-making. Neuro-fuzzy computation ...