Sciweavers

2194 search results - page 25 / 439
» Improving HLRTA*( k )
Sort
View
DASFAA
2006
IEEE
126views Database» more  DASFAA 2006»
16 years 4 days ago
An Efficient Approach for Mining Top-K Fault-Tolerant Repeating Patterns
Abstract. In this paper, an efficient strategy for mining top-K non-trivial faulttolerant repeating patterns (FT-RPs in short) with lengths no less than min_len from data sequences...
Jia-Ling Koh, Yu-Ting Kung
CIAC
2003
Springer
145views Algorithms» more  CIAC 2003»
15 years 11 months ago
Additive Spanners for k-Chordal Graphs
Abstract. In this paper we show that every chordal graph with n vertices and m edges admits an additive 4-spanner with at most 2n−2 edges and an additive 3-spanner with at most O...
Victor Chepoi, Feodor F. Dragan, Chenyu Yan
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
16 years 6 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
152
Voted
DEXA
2003
Springer
193views Database» more  DEXA 2003»
15 years 11 months ago
Supporting KDD Applications by the k-Nearest Neighbor Join
Abstract. The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such t...
Christian Böhm, Florian Krebs
RTAS
2006
IEEE
16 years 2 days ago
Granularity Aware (m, k) Queue Management for Real-time Media Servers
Real-time media servers are becoming increasingly important as the Internet supports more and more multimedia applications. In order to meet these ever increasing demands, real-ti...
Yingxin Jiang, Aaron Striegel