Sciweavers

11211 search results - page 21 / 2243
» Rank-Sensitive Data Structures
Sort
View
ICMS
2010
13 years 9 months ago
TADD: A Computational Framework for Data Analysis Using Discrete Morse Theory
This paper presents a computational framework that allows for a robust extraction of the extremal structure of scalar and vector fields on 2D manifolds embedded in 3D. This struct...
Jan Reininghaus, David Günther, Ingrid Hotz, ...
CORR
2012
Springer
171views Education» more  CORR 2012»
12 years 6 months ago
Discovering causal structures in binary exclusive-or skew acyclic models
Discovering causal relations among observed variables in a given data set is a main topic in studies of statistics and artificial intelligence. Recently, some techniques to disco...
Takanori Inazumi, Takashi Washio, Shohei Shimizu, ...
ASIACRYPT
2010
Springer
13 years 8 months ago
Structured Encryption and Controlled Disclosure
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
Melissa Chase, Seny Kamara
COLING
2010
13 years 5 months ago
Self-Annotation for fine-grained geospatial relation extraction
A great deal of information on the Web is represented in both textual and structured form. The structured form is machinereadable and can be used to augment the textual data. We c...
André Blessing, Hinrich Schütze
MVA
2010
130views Computer Vision» more  MVA 2010»
13 years 8 months ago
Neighborhood linear embedding for intrinsic structure discovery
In this paper, an unsupervised learning algorithm, neighborhood linear embedding (NLE), is proposed to discover the intrinsic structures such as neighborhood relationships, global ...
Shuzhi Sam Ge, Feng Guan, Yaozhang Pan, Ai Poh Loh