219 search results - page 11 / 44 » Fast Algorithms for Finding Extremal Sets |
ESA
2010
Springer
13 years 8 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
AUSAI
2001
Springer
13 years 11 months ago
2001
Springer
A central problem in information retrieval is the automated classification of text documents. While many existing methods achieve good levels of performance, they generally require...
VC
2008
13 years 7 months ago
2008
This paper presents a novel and fast image-space collision detection algorithm with the A-buffer, where the GPU computes the potentially colliding sets (PCSs), and the CPU performs...
CIKM
2007
Springer
13 years 11 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...