Sciweavers

112 search results - page 11 / 23
» An Approximation Algorithm for Alphabet Indexing Problem
Sort
View
197
Voted
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
16 years 29 days ago
Materialized Sample Views for Database Approximation
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...
Shantanu Joshi, Chris Jermaine
VLDB
2002
ACM
126views Database» more  VLDB 2002»
14 years 11 months ago
Exact Indexing of Dynamic Time Warping
The problem of indexing time series has attracted much interest. Most algorithms used to index time series utilize the Euclidean distance or some variation thereof. However, it has...
Eamonn J. Keogh
ICIP
2008
IEEE
16 years 1 months ago
A supervised nonlinear neighborhood embedding of color histogram for image indexing
Subspace learning techniques are widespread in pattern recognition research. They include PCA, ICA, LPP, etc. These techniques are generally linear and unsupervised. The problem o...
Xian-Hua Han, Yen-Wei Chen, Takeshi Sukegawa
ALT
2004
Springer
15 years 8 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
103
Voted
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
14 years 9 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...