Sciweavers

4850 search results - page 678 / 970
» Approximate Data Structures with Applications
Sort
View
GLOBECOM
2008
IEEE
16 years 22 days ago
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
Mahmood Ahmadi, Stephan Wong
180
Voted
3DPVT
2006
IEEE
186views Visualization» more  3DPVT 2006»
16 years 10 days ago
Range Image Registration Based on Circular Features
Range sensing technology allows the photo-realistic modeling of large-scale scenes, such as urban structures. A major bottleneck in the process of 3D scene acquisition is the auto...
Cecilia Chao Chen, Ioannis Stamos
ETFA
2005
IEEE
15 years 12 months ago
Designing usable decision support systems for HVM
In High Volume Manufacturing (HVM), system control is shared between automation and human workers. The social organisation of workers plays an important role in supporting human d...
Connor Upton, Gavin Doherty
ICALP
2005
Springer
15 years 11 months ago
Spatial Logics for Bigraphs
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
Giovanni Conforti, Damiano Macedonio, Vladimiro Sa...
HICSS
2003
IEEE
161views Biometrics» more  HICSS 2003»
15 years 11 months ago
Enhanced Knowledge Management with eXtensible Rule Markup Language
XML has become the standard platform for structured data exchange on the Web. Next concern of Semantic Web is the exchange of rules in markup language form. The rules should be re...
Jae Kyu Lee, Mye M. Sohn