Sciweavers

146 search results - page 8 / 30
» Cyclic reference counting
Sort
View
SELMAS
2005
Springer
14 years 3 months ago
Agent Roles, Qua Individuals and the Counting Problem
Despite the relevance of the concept of role for conceptual modeling and agent-orientation, there is still in the literature a lack of consensus on the meaning of this notion and h...
Giancarlo Guizzardi
WCC
2005
Springer
130views Cryptology» more  WCC 2005»
14 years 3 months ago
On the Design of Codes for DNA Computing
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
Olgica Milenkovic, Navin Kashyap

Publication
173views
15 years 8 months ago
A Comparison of Hashing Schemes for Address Lookup in Computer Networks
Using a trace of address references, we compared the efficiency of several different hashing functions, such as cyclic redundancy checking (CRC) polynomials, Fletcher checksum, fol...
R. Jain
SISAP
2008
IEEE
153views Data Mining» more  SISAP 2008»
14 years 4 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
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 4 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...