653 search results - page 87 / 131 » The size of minimum 3-trees |
WWW
2005
ACM
16 years 16 days ago
2005
ACM
The unarguably fast, and continuous, growth of the volume of indexed (and indexable) documents on the Web poses a great challenge for search engines. This is true regarding not on...
102
click to vote
KDD
2009
ACM
16 years 12 days ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
106
click to vote
VEE
2009
ACM
15 years 6 months ago
2009
ACM
Virtual machine monitors (VMMs), including hypervisors, are a popular platform for implementing various security functionalities. However, traditional VMMs require numerous compon...
SIGECOM
2005
ACM
15 years 5 months ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
SPAA
2010
ACM
15 years 4 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...