4541 search results - page 151 / 909 » Cache-Oblivious Algorithms and Data Structures |
104
click to vote
APPML
2002
15 years 2 months ago
2002
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
122
click to vote
EDBTW
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. The Web has been rapidly “deepened” with the prevalence of databases online. On this “deep Web,” numerous sources are structured, providing schema-rich data– Th...
155
click to vote
DAWAK
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view ...
140
click to vote
CAGD
2006
15 years 3 months ago
2006
This paper describes a comprehensive approach to construct quality meshes for implicit solvation models of biomolecular structures starting from atomic resolution data in the Prot...
132
click to vote
ICANN
2010
Springer
15 years 3 months ago
2010
Springer
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...