116 search results - page 13 / 24 » A New Intersection Model and Improved Algorithms for Toleran... |
147
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
153
Voted
IJON
2010
15 years 2 months ago
2010
We introduce a new causal hierarchical belief network for image segmentation. Contrary to classical tree structured (or pyramidal) models, the factor graph of the network contains...
122
Voted
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
130
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
149
Voted
LCPC
2009
Springer
15 years 8 months ago
2009
Springer
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...