Sciweavers

807 search results - page 21 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
DIS
2007
Springer
15 years 3 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
JCM
2006
78views more  JCM 2006»
14 years 11 months ago
Computationally-Efficient DNLMS-Based Adaptive Algorithms for Echo Cancellation Application
This paper investigates the application of the delayed normalized least mean square (DNLMS) algorithm to echo cancellation. In order to reduce the amount of computations, DNLMS is ...
Raymond Lee, Esam Abdel-Raheem, Mohammed A. S. Kha...
CIC
2004
118views Communications» more  CIC 2004»
15 years 1 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
15 years 4 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
CCECE
2006
IEEE
15 years 5 months ago
New Constraints on Generation of Uniform Random Samples from Evolutionary Trees
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
Anupam Bhattacharjee, Zalia Shams, Kazi Zakia Sult...