245 search results - page 46 / 49 » Group connectivity of graphs with diameter at most 2 |
119
click to vote
PLDI
2004
ACM
15 years 5 months ago
2004
ACM
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...
107
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
NAACL
2003
15 years 1 months ago
2003
e by placing terms in an abstract ‘information space’ based on their occurrences in text corpora, and then allowing a user to visualize local regions of this information space....
120
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
BMCBI
2010
14 years 11 months ago
2010
Background: We present a statistical method of analysis of biological networks based on the exponential random graph model, namely p2-model, as opposed to previous descriptive app...