Sciweavers

840 search results - page 47 / 168
» The Complexity of the Extended GCD Problem
Sort
View
APWEB
2006
Springer
13 years 11 months ago
Efficient Mining Strategy for Frequent Serial Episodes in Temporal Database
Discovering patterns with great significance is an important problem in data mining discipline. A serial episode is defined to be a partially ordered set of events for consecutive ...
Kuo-Yu Huang, Chia-Hui Chang
CIVR
2006
Springer
172views Image Analysis» more  CIVR 2006»
13 years 11 months ago
Retrieving Shapes Efficiently by a Qualitative Shape Descriptor: The Scope Histogram
Abstract. Efficient image retrieval from large image databases is a challenging problem. In this paper we present a method offering constant time complexity for the comparison of t...
Arne Schuldt, Björn Gottfried, Otthein Herzog
ALC
1997
13 years 9 months ago
Synthesising interconnections
In the context of the modular and incremental development of complex systems, viewed as interconnections of interacting components, new dimensions and new problems arise in the ca...
José Luiz Fiadeiro, Antónia Lopes, T...
TCOM
2010
133views more  TCOM 2010»
13 years 2 months ago
Low-complexity decoding for non-binary LDPC codes in high order fields
In this paper, we propose a new implementation of the Extended Min-Sum (EMS) decoder for non-binary LDPC codes. A particularity of the new algorithm is that it takes into accounts...
Adrian Voicila, David Declercq, François Ve...
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara