Sciweavers

570 search results - page 15 / 114
» On the number of zero-sum subsequences
Sort
View
ADMA
2009
Springer
186views Data Mining» more  ADMA 2009»
14 years 4 months ago
Mining Compressed Repetitive Gapped Sequential Patterns Efficiently
Mining frequent sequential patterns from sequence databases has been a central research topic in data mining and various efficient mining sequential patterns algorithms have been p...
Yongxin Tong, Zhao Li, Dan Yu, Shilong Ma, Zhiyuan...
JUCS
2007
108views more  JUCS 2007»
13 years 9 months ago
On Pipelining Sequences of Data-Dependent Loops
: Sequences of data-dependent tasks, each one traversing large data sets, exist in many applications (such as video, image and signal processing applications). Those tasks usually ...
Rui Rodrigues, João M. P. Cardoso
KI
2002
Springer
13 years 9 months ago
Acquisition of Landmark Knowledge from Static and Dynamic Presentation of Route Maps
This contribution reports on ongoing collaborative research at the University of Stanford, Department of Psychology, and the University of Hamburg, Department for Informatics. Ext...
Paul U. Lee, Heike Tappe, Alexander Klippel
ICIP
2003
IEEE
14 years 11 months ago
Image retrieval with SVM active learning embedding Euclidean search
Image retrieval with relevance feedback suffers from the small sample problem. Recently, SVM active learning has been proposed to tackle this problem, showing promising results. H...
Lei Wang, Kap Luk Chan, Yap Peng Tan
FCT
2009
Springer
14 years 2 months ago
Multiway In-Place Merging
Abstract. We present an algorithm for asymptotically efficient multiway blockwise in-place merging. Given an array A containing sorted subsequences A1, . . . , Ak of respective le...
Viliam Geffert, Jozef Gajdos