Sciweavers

3136 search results - page 66 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
ER
2006
Springer
112views Database» more  ER 2006»
15 years 9 months ago
A DAG Comparison Algorithm and Its Application to Temporal Data Warehousing
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
Johann Eder, Karl Wiggisser
TCOM
2008
88views more  TCOM 2008»
15 years 6 months ago
Maximum likelihood based estimation of frequency and phase offset in DCT OFDM systems under non-circular transmissions: algorith
Recently, the advantages of the discrete cosine transform (DCT) based orthogonal frequency-division multiplexing (OFDM) have come to the light. We thus consider DCTOFDM with non-ci...
Feifei Gao, Tao Cui, Arumugam Nallanathan, Chintha...
ISCI
2007
141views more  ISCI 2007»
15 years 6 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
CIDM
2009
IEEE
15 years 10 months ago
Empirical comparison of graph classification algorithms
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Coo...