Sciweavers

244 search results - page 14 / 49
» Fast Set Intersection in Memory
Sort
View
TOIS
2002
97views more  TOIS 2002»
13 years 7 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
TCS
2008
13 years 7 months ago
Reconstruction of convex lattice sets from tomographic projections in quartic time
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. Many algorithms have been publish...
Sara Brunetti, Alain Daurat
IJSN
2007
106views more  IJSN 2007»
13 years 7 months ago
Hash-AV: fast virus signature scanning by cache-resident filters
Abstract— Fast virus scanning is becoming increasingly important in today’s Internet. While Moore’s law continues to double CPU cycle speed, virus scanning applications fail ...
Ozgun Erdogan, Pei Cao
PR
2008
202views more  PR 2008»
13 years 6 months ago
Building compact MQDF classifier for large character set recognition by subspace distribution sharing
Quadratic classifier with modified quadratic discriminant function (MQDF) has been successfully applied to recognition of handwritten characters to achieve very good performance. ...
Teng Long, Lianwen Jin
CHI
2010
ACM
13 years 5 months ago
Protractor: a fast and accurate gesture recognizer
Protractor is a novel gesture recognizer that can be easily implemented and quickly customized for different users. Protractor uses a nearest neighbor approach, which recognizes a...
Yang Li