3267 search results - page 562 / 654 » Generalized quasirandom graphs |
133
click to vote
LICS
1997
IEEE
15 years 8 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
160
Voted
WG
1995
Springer
15 years 8 months ago
1995
Springer
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...
140
click to vote
SC
1991
ACM
15 years 8 months ago
1991
ACM
Kanada, Y., A method of vector processing for shared symbolic data, Parallel Computing, X (1993) XXX-XXX. Conventional processing techniques for pipelined vector processors such a...
163
click to vote
DAC
2010
ACM
15 years 7 months ago
2010
ACM
Online social networks are a growing internet phenomenon: they connect millions of individuals through sharing of common interests, political and religious views, careers, etc. So...
154
click to vote
BTW
2009
Springer
15 years 7 months ago
2009
Springer
: Very recently, Cao et al. presented the MAPLE approach, which accelerates queries with multiple instances of the same relation by sharing their scan operator. The principal idea ...