Sciweavers

2127 search results - page 84 / 426
» Computing large matchings fast
Sort
View
CVPR
2006
IEEE
16 years 5 months ago
Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories
This paper presents a method for recognizing scene categories based on approximate global geometric correspondence. This technique works by partitioning the image into increasingl...
Svetlana Lazebnik, Cordelia Schmid, Jean Ponce
112
Voted
ISSAC
2007
Springer
107views Mathematics» more  ISSAC 2007»
15 years 9 months ago
A disk-based parallel implementation for direct condensation of large permutation modules
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
Eric Robinson, Jürgen Müller 0004, Gene ...
ICCV
2009
IEEE
15 years 1 months ago
Efficient indexing for large scale visual search
With the popularity of "bag of visual terms" representations of images, many text indexing techniques have been applied in large-scale image retrieval systems. However, ...
Xiao Zhang, Zhiwei Li, Lei Zhang, Wei-Ying Ma, Heu...
136
Voted
RAID
2009
Springer
15 years 10 months ago
Regular Expression Matching on Graphics Hardware for Intrusion Detection
The expressive power of regular expressions has been often exploited in network intrusion detection systems, virus scanners, and spam filtering applications. However, the flexibl...
Giorgos Vasiliadis, Michalis Polychronakis, Spyros...
138
Voted
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
15 years 3 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro