244 search results - page 12 / 49 » Balanced Cayley graphs and balanced planar graphs |
IWOMP
2009
Springer
14 years 3 months ago
2009
Springer
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
ICALP
2003
Springer
14 years 2 months ago
2003
Springer
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
PAKDD
2011
ACM
12 years 12 months ago
2011
ACM
A structural similarity kernel is presented in this paper for SVM learning, especially for learning with imbalanced datasets. Kernels in SVM are usually pairwise, comparing the sim...
INFOCOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...