3136 search results - page 347 / 628 » Comparison of Clique-Listing Algorithms |
157
click to vote
AIMS
2007
Springer
16 years 26 days ago
2007
Springer
Peer-to-peer overlay networks provide a useful infrastructure for building distributed applications. These networks provide efficient and fault-tolerant routing and object locating...
165
click to vote
ECML
2007
Springer
16 years 26 days ago
2007
Springer
In this paper we study the identification of sparse interaction networks as a machine learning problem. Sparsity means that we are provided with a small data set and a high number...
190
click to vote
ECML
2007
Springer
16 years 26 days ago
2007
Springer
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
170
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
There exist a number of high-performance Multi-Objective Evolutionary Algorithms (MOEAs) for solving MultiObjective Optimization (MOO) problems; two of the best are NSGA-II and -M...
169
click to vote
HPCC
2007
Springer
16 years 25 days ago
2007
Springer
Computing ”in-place and in-order”FFT poses a very difficult problem on hierarchical memory architectures where data movement can seriously degrade the performance. In this pape...