4171 search results - page 301 / 835 » Choice numbers of graphs |
172
click to vote
IPL
2010
15 years 5 months ago
2010
Resource bisimilarity has been proposed in the literature on concurrency theory as a notion of bisimilarity over labeled transition systems that takes into account the number of c...
209
click to vote
SAC
2012
ACM
14 years 2 months ago
2012
ACM
We consider kernel density estimation when the observations are contaminated by measurement errors. It is well known that the success of kernel estimators depends heavily on the c...
225
click to vote
PVM
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
198
click to vote
ISAAC
2005
Springer
16 years 9 days ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
161
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...