119 search results - page 14 / 24 » Batch Range Proof for Practical Small Ranges |
112
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
125
click to vote
AMFG
2007
IEEE
15 years 6 months ago
2007
IEEE
Extending recognition to uncontrolled situations is a key challenge for practical face recognition systems. Finding efficient and discriminative facial appearance descriptors is c...
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
106
click to vote
EUROPKI
2004
Springer
15 years 5 months ago
2004
Springer
The implementation of a standard PKI in a mobile ad hoc network (MANET) is not practical for several reasons: (1) lack of a fixed infrastructure; (2) a centralized certification au...
94
Voted
ESWS
2008
Springer
15 years 1 months ago
2008
Springer
Evaluation of ontology alignments is in practice done in two ways: (1) assessing individual correspondences and (2) comparing the alignment to a reference alignment. However, this ...