Sciweavers

1265 search results - page 28 / 253
» Finding the Key to a Synapse
Sort
View
ACSAC
2009
IEEE
14 years 2 months ago
Privacy through Noise: A Design Space for Private Identification
To protect privacy in large systems, users must be able to authenticate against a central server without disclosing their identity to the network. Private identification protocols ...
Karsten Nohl, David Evans
HOTOS
2007
IEEE
13 years 11 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
CORR
2012
Springer
185views Education» more  CORR 2012»
12 years 3 months ago
Bayesian network learning with cutting planes
The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is considered. Learning is cast explicitly as an optimisatio...
James Cussens
SIGIR
1992
ACM
13 years 11 months ago
A Faster Algorithm for Constructing Minimal Perfect Hash Functions
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...
Edward A. Fox, Qi Fan Chen, Lenwood S. Heath
JUCS
2002
112views more  JUCS 2002»
13 years 7 months ago
Ontology-Based Skills Management: Goals, Opportunities and Challenges
: Establishing electronically accessible repositories of people's capabilities, experiences, and key knowledge areas is key in setting up Enterprise Knowledge Management. A sk...
Jacqueline Renée Reich, Peter Brockhausen, ...