4850 search results - page 751 / 970 » Approximate Data Structures with Applications |
164
click to vote
DIM
2007
ACM
15 years 8 months ago
2007
ACM
In this paper, we examine how conclusions about linkability threats can be drawn by analyzing message contents and subject knowledge in arbitrary communication systems. At first, ...
137
click to vote
CSB
2004
IEEE
15 years 8 months ago
2004
IEEE
There is considerable interest in computational methods to assist in the use of genetic polymorphism data for locating disease-related genes. Haplotypes, contiguous sets of correl...
154
click to vote
ER
2006
Springer
15 years 8 months ago
2006
Springer
Ontologies on the Semantic Web are by nature decentralized. From the body of ontology mapping approaches, we can draw a conclusion that an effective approach to automate ontology m...
146
click to vote
CAIP
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. In this paper a new method for analyzing the intrinsic dimensionality (ID) of low dimensional manifolds in high dimensional feature spaces is presented. The basic idea is...
163
click to vote
SAC
1995
ACM
15 years 8 months ago
1995
ACM
Experiments in High Energy Physics (HEP) generate tremendous amounts of data. For example, the accelerator at CERN is expected to generate petabytes per year. New HEP discoveries ...