Sciweavers

8825 search results - page 64 / 1765
» All for one or one for all
Sort
View
ICPR
2010
IEEE
14 years 1 months ago
Normalized Sum-Over-Paths Edit Distances
Abstract--In this paper, normalized SoP string-edit distances, taking into account all possible alignments between two sequences, are investigated. These normalized distances are v...
Silvia García, François Fouss, Masashi Shimbo, M...
FIMI
2003
123views Data Mining» more  FIMI 2003»
13 years 11 months ago
Apriori, A Depth First Implementation
We will discuss , the depth first implementation of APRIORI as devised in 1999 (see [8]). Given a database, this algorithm builds a trie in memory that contains all frequent item...
Walter A. Kosters, Wim Pijls
TIT
2002
54views more  TIT 2002»
13 years 9 months ago
Quasi-cyclic dyadic codes in the Walsh--Hadamard transform domain
A code is -quasi-cyclic ( -QC) if there is an integer such that cyclic shift of a codeword by -positions is also a codeword. For = 1, cyclic codes are obtained. A dyadic code is a ...
B. Sundar Rajan, Moon Ho Lee
VLDB
2002
ACM
88views Database» more  VLDB 2002»
13 years 9 months ago
An XML query engine for network-bound data
XML has become the lingua franca for data exchange and integration across administrative and enterprise boundaries. Nearly all data providers are adding XML import or export capabi...
Zachary G. Ives, Alon Y. Halevy, Daniel S. Weld
IPPS
2007
IEEE
14 years 4 months ago
Using Linearization for Global Consistency in SSR
Novel routing algorithms such as scalable source routing (SSR) and virtual ring routing (VRR) need to set up and maintain a virtual ring structure among all the nodes in the netwo...
Kendy Kutzner, Thomas Fuhrmann