1951 search results - page 280 / 391 » An algorithm for improving graph partitions |
135
click to vote
SIGMOD
1997
ACM
15 years 8 months ago
1997
ACM
The Partitioned Based Spatial-Merge Join (PBSM) of Patel and DeWitt and the Size Separation Spatial Join (S3 J) of Koudas and Sevcik are considered to be among the most efficient ...
154
click to vote
NN
2008
Springer
15 years 3 months ago
2008
Springer
This paper introduces an approach called Clustering and Co-evolution to Construct Neural Network Ensembles (CONE). This approach creates neural network ensembles in an innovative ...
146
click to vote
DAC
2006
ACM
16 years 5 months ago
2006
ACM
A novel method to solve the state encoding problem in Signal Transition Graphs is presented. It is based on the structural theory of Petri nets and can be applied to large specifi...
161
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
121
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...