Sciweavers

11214 search results - page 396 / 2243
» Just-in-time data structures
Sort
View
IANDC
2006
77views more  IANDC 2006»
15 years 6 months ago
Lower and upper bounds on obtaining history independence
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
Niv Buchbinder, Erez Petrank
ISBI
2004
IEEE
16 years 7 months ago
Nonlinear Dimension Reduction of fMRI Data: The Laplacian Embedding Approach
In this paper, we introduce the use of nonlinear dimension reduction for the analysis of functional neuroimaging datasets. Using a Laplacian Embedding approach, we show the power ...
Olivier D. Faugeras, Bertrand Thirion
ESWS
2006
Springer
15 years 10 months ago
An Iterative Algorithm for Ontology Mapping Capable of Using Training Data
We present a new iterative algorithm for ontology mapping where we combine standard string distance metrics with a structural similarity measure that is based on a vector represent...
Andreas Heß
LREC
2010
181views Education» more  LREC 2010»
15 years 8 months ago
A Data Category Registry- and Component-based Metadata Framework
We describe our computer-supported framework to overcome the rule of metadata schism. It combines the use of controlled vocabularies, managed by a data category registry, with a c...
Daan Broeder, Marc Kemps-Snijders, Dieter Van Uytv...
NIPS
2004
15 years 8 months ago
Euclidean Embedding of Co-Occurrence Data
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
Amir Globerson, Gal Chechik, Fernando C. Pereira, ...