1542 search results - page 266 / 309 » The metamathematics of random graphs |
143
click to vote
SWAT
2004
Springer
15 years 11 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...
146
click to vote
APPROX
2010
Springer
15 years 7 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...
169
click to vote
RECOMB
2003
Springer
16 years 6 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...
160
click to vote
CIKM
2007
Springer
16 years 9 days 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...
256
click to vote
STOC
1997
ACM
15 years 10 months 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...