Sciweavers

730 search results - page 90 / 146
» Faster dimension reduction
Sort
View
CVPR
2000
IEEE
14 years 10 months ago
Nearest Neighbor Search Using Additive Binary Tree
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consum...
Sung-Hyuk Cha, Sargur N. Srihari
ECCV
2002
Springer
14 years 10 months ago
Increasing Space-Time Resolution in Video
We propose a method for constructing a video sequence of high space-time resolution by combining information from multiple lowresolution video sequences of the same dynamic scene. ...
Eli Shechtman, Yaron Caspi, Michal Irani
ICDE
2009
IEEE
163views Database» more  ICDE 2009»
14 years 10 months ago
Distance-Based Representative Skyline
Given an integer k, a representative skyline contains the k skyline points that best describe the tradeoffs among different dimensions offered by the full skyline. Although this to...
Yufei Tao, Ling Ding, Xuemin Lin, Jian Pei
EDBT
2006
ACM
145views Database» more  EDBT 2006»
14 years 9 months ago
Indexing Spatially Sensitive Distance Measures Using Multi-resolution Lower Bounds
Abstract. Comparison of images requires a distance metric that is sensitive to the spatial location of objects and features. Such sensitive distance measures can, however, be compu...
Vebjorn Ljosa, Arnab Bhattacharya, Ambuj K. Singh
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
14 years 6 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu