Sciweavers

901 search results - page 127 / 181
» On Anonymization of String Data
Sort
View
LCN
2008
IEEE
15 years 7 months ago
P2P directory search: Signature Array Hash Table
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
Miguel Jimeno, Kenneth J. Christensen
SISAP
2008
IEEE
153views Data Mining» more  SISAP 2008»
15 years 7 months ago
Counting Distance Permutations
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
Matthew Skala
ICRA
2005
IEEE
124views Robotics» more  ICRA 2005»
15 years 7 months ago
What Are the Ants Doing? Vision-Based Tracking and Reconstruction of Control Programs
— In this paper, we study the problem of going from a real-world, multi-agent system to the generation of control programs in an automatic fashion. In particular, a computer visi...
Magnus Egerstedt, Tucker R. Balch, Frank Dellaert,...
3DPVT
2002
IEEE
150views Visualization» more  3DPVT 2002»
15 years 6 months ago
Coding with ASCII: compact, yet text-based 3D content
Because of the convenience of a text-based format 3D content is often published in form of a gzipped file that contains an ASCII description of the scene graph. While compressed ...
Martin Isenburg, Jack Snoeyink
CISSE
2008
Springer
15 years 3 months ago
Testing Grammars For Top-Down Parsers
According to the software engineering perspective, grammars can be viewed as "Specifications for defining languages or compilers". They form the basics of languages and ...
A. M. Paracha, F. Franek