400 search results - page 50 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
137
click to vote
ICALP
2009
Springer
16 years 2 days ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
SDM
2009
SIAM
15 years 9 months ago
2009
SIAM
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
117
click to vote
SSDBM
1999
IEEE
15 years 4 months ago
1999
IEEE
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
130
click to vote
PE
2000
Springer
14 years 11 months ago
2000
Springer
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
GRID
2007
Springer
15 years 3 months ago
2007
Springer
We propose strategies to efficiently execute a query workload, which consists of multiple related queries submitted against a scientific dataset, on a distributed-memory system in...