Sciweavers

2745 search results - page 82 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
ICCV
2009
IEEE
15 years 1 months ago
Efficient indexing for large scale visual search
With the popularity of "bag of visual terms" representations of images, many text indexing techniques have been applied in large-scale image retrieval systems. However, ...
Xiao Zhang, Zhiwei Li, Lei Zhang, Wei-Ying Ma, Heu...
162
Voted
AAECC
2003
Springer
165views Algorithms» more  AAECC 2003»
15 years 7 months ago
Fast Point Multiplication on Elliptic Curves through Isogenies
Elliptic curve cryptosystems are usually implemented over fields of characteristic two or over (large) prime fields. For large prime fields, projective coordinates are more suitabl...
Eric Brier, Marc Joye
142
Voted
EDBT
2006
ACM
182views Database» more  EDBT 2006»
16 years 3 months ago
On High Dimensional Skylines
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...
Chee Yong Chan, H. V. Jagadish, Kian-Lee Tan, Anth...
158
Voted
DBSEC
2008
136views Database» more  DBSEC 2008»
15 years 5 months ago
An Opinion Model for Evaluating Malicious Activities in Pervasive Computing Systems
Pervasive computing applications typically involve cooperation among a number of entities spanning multiple organizations. Any security breach in any single entity can have very fa...
Indrajit Ray, Nayot Poolsappasit, Rinku Dewri
125
Voted
CHINAF
2008
69views more  CHINAF 2008»
15 years 3 months ago
Efficient Tate pairing computation using double-base chains
Pairing-based cryptosystems have been developing very fast in the last few years. The efficiencies of the cryptosystems are determined by the computation of the Tate pairing. In th...
Changan Zhao, Fangguo Zhang, Jiwu Huang