42 search results - page 5 / 9 » Component Evolution in General Random Intersection Graphs |
ICALP
1992
Springer
13 years 12 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
NIPS
2007
13 years 9 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
GG
2004
Springer
14 years 1 months ago
2004
Springer
Graphs are well-known, well-understood, and frequently used means to depict networks of related items. They are successfully used as the underlying mathematical concept in various ...
TR
2011
13 years 2 months ago
2011
We consider repairable reliability systems with m components, the lifetimes and repair times of which are independent. The l-th component can be either in the failure state 0 or i...