668 search results - page 102 / 134 » Algorithmics and Applications of Tree and Graph Searching |
132
click to vote
DAWAK
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...
112
Voted
PPOPP
2010
ACM
15 years 11 months ago
2010
ACM
Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications. Recent work by the Galois project has pr...
120
click to vote
APN
2004
Springer
15 years 7 months ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
113
click to vote
TCIAIG
2010
14 years 8 months ago
2010
This paper presents the recent technical advances in Monte-Carlo Tree Search for the Game of Go, shows the many similarities and the rare differences between the current best progr...
132
click to vote
ASIACRYPT
2010
Springer
14 years 12 months ago
2010
Springer
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...