Sciweavers

3740 search results - page 334 / 748
» A Fast Skeletonization Method
Sort
View
SSDBM
2000
IEEE
128views Database» more  SSDBM 2000»
15 years 7 months ago
Supporting Content-Based Searches on Time Series via Approximation
Fast retrieval of time series in terms of their contents is important in many application domains. This paper studies database techniques supporting fast searches for time series ...
Changzhou Wang, Xiaoyang Sean Wang
CC
2008
Springer
15 years 5 months ago
Generating SIMD Vectorized Permutations
Abstract. This paper introduces a method to generate efficient vectorized implementations of small stride permutations using only vector load and vector shuffle instructions. These...
Franz Franchetti, Markus Püschel
NIPS
2004
15 years 4 months ago
The power of feature clustering: An application to object detection
We give a fast rejection scheme that is based on image segments and demonstrate it on the canonical example of face detection. However, instead of focusing on the detection step w...
Shai Avidan, Moshe Butman
CORR
2007
Springer
135views Education» more  CORR 2007»
15 years 2 months ago
Detailed Network Measurements Using Sparse Graph Counters: The Theory
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
Yi Lu, Andrea Montanari, Balaji Prabhakar
AAAI
2012
13 years 5 months ago
Double-Bit Quantization for Hashing
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
Weihao Kong, Wu-Jun Li