1736 search results - page 198 / 348 » On antimagic directed graphs |
183
click to vote
MCS
2010
Springer
15 years 8 months ago
2010
Springer
Selecting a set of good and diverse base classifiers is essential for building multiple classifier systems. However, almost all commonly used procedures for selecting such base cla...
157
click to vote
CHI
2008
ACM
16 years 6 months ago
2008
ACM
Collaborative filtering (CF) has been successfully deployed over the years to compute predictions on items based on a user's correlation with a set of peers. The black-box na...
158
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
181
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
183
click to vote
SIGIR
2009
ACM
16 years 1 months ago
2009
ACM
Social network systems, like last.fm, play a significant role in Web 2.0, containing large amounts of multimedia-enriched data that are enhanced both by explicit user-provided an...