Sciweavers

8437 search results - page 208 / 1688
» Preferences over Sets
Sort
View
ASIACRYPT
2000
Springer
15 years 10 months ago
Trapdooring Discrete Logarithms on Elliptic Curves over Rings
This paper introduces three new probabilistic encryption schemes using elliptic curves over rings. The cryptosystems are based on three specific trapdoor mechanisms allowing the r...
Pascal Paillier
KR
2010
Springer
15 years 10 months ago
Improving Query Answering over DL-Lite Ontologies
The DL-Lite family of Description Logics has been designed with the specific goal of allowing for answering complex queries (in particular, conjunctive queries) over ontologies w...
Riccardo Rosati, Alessandro Almatelli
CIKM
2006
Springer
15 years 10 months ago
Efficient join processing over uncertain data
In an uncertain database, each data item is modeled as a range associated with a probability density function. Previous works for this kind of data have focussed on simple queries...
Reynold Cheng, Sarvjeet Singh, Sunil Prabhakar, Ra...
EDBTW
2006
Springer
15 years 10 months ago
Efficiently Processing XML Queries over Fragmented Repositories with PartiX
The data volume of XML repositories and the response time of query processing have become critical issues for many applications, especially for those in the Web. An interesting alt...
Alexandre Andrade, Gabriela Ruberg, Fernanda Arauj...
AAAI
2008
15 years 8 months ago
Sparse Projections over Graph
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
Deng Cai, Xiaofei He, Jiawei Han