Content-based image retrieval heavily relies on the indexing structure. Current index structures, such as the R-tree, the SS-tree and the X-tree, have a large overlapping area among their nodes, especially at the high (parent) levels of the indexing tree. The overlapping area causes the search engin
Using Abelian Varieties to Improve Pairing-Based Cryptography
β Scribed by K. Rubin; A. Silverberg
- Publisher
- Springer
- Year
- 2008
- Tongue
- English
- Weight
- 566 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0933-2790
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract As the health care industry and the occupational therapy profession experience rapid change and growth, our professional preparation and continuing education must prepare graduates and therapists for an evolving practice environment. By exploring and evaluating alternative teaching meth
In this article we describe results of our research on the disambiguation of user queries using ontologies for categorization. We present an approach to cluster search results by using classes or "Sense Folders" ~prototype categories! derived from the concepts of an assigned ontology, in our case Wo
This article describes an algorithm for computing the Selmer group of an isogeny between abelian varieties. This algorithm applies when there is an isogeny from the image abelian variety to the Jacobian of a curve. The use of an auxiliary Jacobian simplifies the determination of locally trivial coho