20441 search results - page 3795 / 4089 » Locally Computable Structures |
276
click to vote
SDM
2011
SIAM
14 years 6 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
111
click to vote
SIAMREV
2011
14 years 6 months ago
2011
We propose a mathematical model for an infestation of a wooded area by a beetle species in which the larvae develop deep in the wood of living trees. Due to the difficulties of det...
177
click to vote
SIGMOD
2011
ACM
14 years 6 months ago
2011
ACM
Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data ...
134
click to vote
AAAI
2011
14 years 3 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
131
click to vote
AAAI
2011
14 years 3 months ago
2011
The conservation of wildlife corridors between existing habitat preserves is important for combating the effects of habitat loss and fragmentation facing species of concern. We in...