148 search results - page 16 / 30 » Linear Time Algorithm for the Longest Common Repeat Problem |
WABI
2005
Springer
14 years 1 months ago
2005
Springer
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
SPAA
1997
ACM
14 years 1 days ago
1997
ACM
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
ICA
2010
Springer
13 years 9 months ago
2010
Springer
In this paper, we propose a novel method for blind source separation (BSS) based on time-frequency sparseness (TF) that can estimate the number of sources and time-frequency masks,...
HASKELL
2006
ACM
14 years 1 months ago
2006
ACM
Many numerical algorithms are specified in terms of operations on vectors and matrices. Matrix operations can be executed extremely efficiently using specialized linear algebra k...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—Surveillance systems, such as sensor networks and surveillance camera networks, have been widely deployed to monitor events in many different scenarios. One common way to conser...