1538 search results - page 235 / 308 » Spectral Techniques in Graph Algorithms |
199
click to vote
VLDB
2007
ACM
16 years 1 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
134
click to vote
ICDM
2007
IEEE
15 years 7 months ago
2007
IEEE
Data streams are often locally correlated, with a subset of streams exhibiting coherent patterns over a subset of time points. Subspace clustering can discover clusters of objects...
APPROX
2007
Springer
15 years 5 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
108
click to vote
EGH
2004
Springer
15 years 5 months ago
2004
Springer
Partitioning fragment shaders into multiple rendering passes is an effective technique for virtualizing shading resource limits in graphics hardware. The Recursive Dominator Split...
125
click to vote
COMPGEOM
2005
ACM
15 years 3 months ago
2005
ACM
We present an efficient algorithm for maintaining the boundary and surface area of protein molecules as they undergo conformational changes. We also describe a robust implementati...