Sciweavers

4171 search results - page 207 / 835
» Choice numbers of graphs
Sort
View
LAWEB
2006
IEEE
16 years 20 days 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»
15 years 10 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
ICC
2007
IEEE
119views Communications» more  ICC 2007»
16 years 29 days 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
15 years 8 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
ENDM
2006
70views more  ENDM 2006»
15 years 6 months ago
Quasirandomness in Graphs
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...
Benjamin Doerr, Tobias Friedrich