1542 search results - page 266 / 309 » The metamathematics of random graphs |
SWAT
2004
Springer
14 years 2 months ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
RECOMB
2003
Springer
14 years 9 months ago
2003
Springer
We develop a new framework for inferring models of transcriptional regulation. The models in this approach, which we call physical models, are constructed on the basis of verifiab...
CIKM
2007
Springer
14 years 2 months ago
2007
Springer
Dictionary-based approaches to query translation have been widely used in Cross-Language Information Retrieval (CLIR) experiments. Using these approaches, translation has been not...
STOC
1997
ACM
14 years 25 days ago
1997
ACM
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...