Sciweavers

216 search results - page 28 / 44
» Fast Optimal Algorithms for Computing All the Repeats in a S...
Sort
View
MM
2006
ACM
180views Multimedia» more  MM 2006»
14 years 2 months ago
Fast tracking of near-duplicate keyframes in broadcast domain with transitivity propagation
The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this pape...
Chong-Wah Ngo, Wanlei Zhao, Yu-Gang Jiang
SIGMOD
1997
ACM
127views Database» more  SIGMOD 1997»
14 years 25 days ago
Fast Parallel Similarity Search in Multimedia Databases
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
Stefan Berchtold, Christian Böhm, Bernhard Br...
SAC
2004
ACM
14 years 2 months ago
Solving the maximum clique problem by k-opt local search
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihis...
COCOON
2005
Springer
14 years 2 months ago
RIATA-HGT: A Fast and Accurate Heuristic for Reconstructing Horizontal Gene Transfer
Horizontal gene transfer (HGT) plays a major role in microbial genome diversification, and is claimed to be rampant among various groups of genes in bacteria. Further, HGT is a ma...
Luay Nakhleh, Derek A. Ruths, Li-San Wang
CVPR
2009
IEEE
14 years 3 months ago
Optimal scanning for faster object detection
Recent years have seen the development of fast and accurate algorithms for detecting objects in images. However, as the size of the scene grows, so do the running-times of these a...
Nicholas J. Butko, Javier R. Movellan