5115 search results - page 354 / 1023 » On Randomized Lanczos Algorithms |
229
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
200
click to vote
WIOPT
2006
IEEE
16 years 1 months ago
2006
IEEE
— Channel-aware scheduling strategies provide an effective mechanism for improving the throughput performance in wireless data networks by exploiting channel fluctuations. The p...
198
click to vote
AUSAI
2005
Springer
16 years 29 days ago
2005
Springer
: In a canonical genetic algorithm, the reproduction operators (crossover and mutation) are random in nature. The direction of the search carried out by the GA system is driven pur...
220
click to vote
GECCO
2005
Springer
16 years 26 days ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
212
click to vote
SIGMOD
2004
ACM
16 years 25 days ago
2004
ACM
Data items are often associated with a location in which they are present or collected, and their relevance or in uence decays with their distance. Aggregate values over such data...