WALCOM
2008
IEEE
13 years 5 months ago
2008
IEEE
Abstract. Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (...
SOFSEM
2000
Springer
13 years 7 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
ICDM
2007
IEEE
13 years 8 months ago
2007
IEEE
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...
CPM
2009
Springer
13 years 8 months ago
2009
Springer
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the Bndm algorithm and a s...
LATIN
1998
Springer
13 years 8 months ago
1998
Springer
The existence of efficient algorithms to compute the eigenvectors and eigenvalues of graphs supplies a useful tool for the design of various graph algorithms. In this survey we de...
DCC
2005
IEEE
14 years 3 months ago
2005
IEEE
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
SIGMOD
2007
ACM
14 years 4 months ago
2007
ACM
RECOMB
2008
Springer
14 years 4 months ago
2008
Springer
WWW
2008
ACM
14 years 5 months ago
2008
ACM
With the increasing amount of data and the need to integrate data from multiple data sources, a challenging issue is to find near duplicate records efficiently. In this paper, we ...
ICDE
2009
IEEE
14 years 6 months ago
2009
IEEE
In uncertain and probabilistic databases, confidence values (or probabilities) are associated with each data item. Confidence values are assigned to query results based on combinin...