3267 search results - page 303 / 654 » Generalized quasirandom graphs |
189
click to vote
SODA
2007
ACM
15 years 8 months ago
2007
ACM
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
127
click to vote
CACM
2008
15 years 7 months ago
2008
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
218
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
176
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
Social hierarchy and stratification among humans is a well studied concept in sociology. The popularity of online social networks presents an opportunity to study social hierarch...
219
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
The ability to aggregate huge volumes of queries over a large population of users allows search engines to build precise models for a variety of query-assistance features such as ...