Sciweavers

3204 search results - page 150 / 641
» The b-chromatic Number of a Graph
Sort
View
LAWEB
2006
IEEE
14 years 4 months ago
Where and How Duplicates Occur in the Web
In this paper we study duplicates on the Web, using collections containing documents of all sites under the .cl domain that represent accurate and representative subsets of the We...
Álvaro R. Pereira Jr., Ricardo A. Baeza-Yat...
APPROX
2006
Springer
117views Algorithms» more  APPROX 2006»
14 years 2 months ago
Fractional Matching Via Balls-and-Bins
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
Rajeev Motwani, Rina Panigrahy, Ying Xu 0002
JCT
2010
135views more  JCT 2010»
13 years 8 months ago
Countable connected-homogeneous graphs
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...
Robert Gray, D. Macpherson
ICC
2007
IEEE
119views Communications» more  ICC 2007»
14 years 4 months ago
Graph-Based Detector for BLAST Architecture
Abstract— We propose belief propagation (BP) based detection algorithms for the Bell labs layered space-time (BLAST) architectures. We first develop a full complexity BP algorit...
Jun Hu, Tolga M. Duman
FLAIRS
2006
13 years 11 months ago
Improving Modularity in Genetic Programming Using Graph-Based Data Mining
We propose to improve the efficiency of genetic programming, a method to automatically evolve computer programs. We use graph-based data mining to identify common aspects of highl...
Istvan Jonyer, Akiko Himes