3818 search results - page 549 / 764 » Learning from Order Examples |
177
click to vote
ACNS
2007
Springer
16 years 14 days ago
2007
Springer
Many protocols that are based on homomorphic encryption are private only if a client submits inputs from a limited range S. Conditional disclosure of secrets (CDS) helps to overcom...
172
click to vote
COSIT
2007
Springer
16 years 14 days ago
2007
Springer
Higher level semantics are considered useful in the geospatial domain, yet there is no general consensus on the form these semantics should take. Indeed, knowledge representation p...
155
click to vote
WDAG
2007
Springer
16 years 12 days ago
2007
Springer
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
144
click to vote
3DPVT
2006
IEEE
16 years 11 days ago
2006
IEEE
In this paper, we propose a visual hull algorithm, which guarantees a correct construction even in the presence of partial occlusion, while “correct” here means that the real ...
141
click to vote
KCAP
2005
ACM
15 years 12 months ago
2005
ACM
In order to evaluate the performance of ontology matching algorithms it is necessary to confront them with test ontologies and to compare the results. The most prominent criteria ...