3267 search results - page 598 / 654 » Generalized quasirandom graphs |
CLOUD
2010
ACM
15 years 4 months ago
2010
ACM
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...
102
click to vote
SPAA
2010
ACM
15 years 3 months ago
2010
ACM
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
139
Voted
CIKM
2009
Springer
15 years 3 months ago
2009
Springer
Traditional desktop search engines only support keyword based search that needs exact keyword matching to find resources. However, users generally have a vague picture of what is...
ESSLLI
1999
Springer
15 years 3 months ago
1999
Springer
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
108
Voted
FOCS
1998
IEEE
15 years 3 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...