4171 search results - page 664 / 835 » Choice numbers of graphs |
276
click to vote
WAE
2001
15 years 7 months ago
2001
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
157
click to vote
UAI
2004
15 years 7 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
167
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Scheduling collective communications (CC) in networks based on optimal graphs and digraphs has been done with the use of the evolutionary techniques. Inter-node communication patt...
169
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We develop a novel online learning algorithm for the group lasso in order to efficiently find the important explanatory factors in a grouped manner. Different from traditional bat...
161
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
This paper describes a low-complexity approach for reconstructing average packet arrival rates and instantaneous packet counts at a router in a communication network, where the arr...