Sciweavers

1403 search results - page 276 / 281
» Set cover algorithms for very large datasets
Sort
View
MIR
2004
ACM
154views Multimedia» more  MIR 2004»
14 years 1 months ago
Fast and robust short video clip search using an index structure
In this paper, we present an index structure-based method to fast and robustly search short video clips in large video collections. First we temporally segment a given long video ...
Junsong Yuan, Ling-Yu Duan, Qi Tian, Changsheng Xu
INFOCOM
2003
IEEE
14 years 1 months ago
Exploring the trade-off between label size and stack depth in MPLS Routing
— Multiprotocol Label Switching or MPLS technology is being increasingly deployed by several of the largest Internet service providers to solve problems such as traffic engineer...
Anupam Gupta, Amit Kumar, Rajeev Rastogi
EDBT
1998
ACM
155views Database» more  EDBT 1998»
14 years 19 days ago
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
3DIM
2003
IEEE
14 years 1 days ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
13 years 10 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti