4541 search results - page 180 / 909 » Cache-Oblivious Algorithms and Data Structures |
132
click to vote
ALGORITHMICA
2010
15 years 3 months ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
113
click to vote
TALG
2008
15 years 3 months ago
2008
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
130
click to vote
PG
2002
IEEE
15 years 8 months ago
2002
IEEE
We propose a divide and conquer algorithm for the single resolution encoding of triangle mesh connectivity. Starting from a boundary edge we grow a zig-zag strip which divides the...
129
click to vote
COMPSAC
2002
IEEE
15 years 8 months ago
2002
IEEE
Compressed pattern matching refers to the process of, given a text in a compressed form and a pattern, finding all the occurrences of the pattern in the text without decompressio...
126
click to vote
FIMI
2003
15 years 4 months ago
2003
This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...