Sciweavers

534 search results - page 34 / 107
» Efficient polynomial L-approximations
Sort
View
PKC
1998
Springer
123views Cryptology» more  PKC 1998»
13 years 11 months ago
Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map
In this paper, we present two efficient algorithms computing scalar multiplications of a point in an elliptic curve defined over a small finite field, the Frobenius map of which ha...
Jung Hee Cheon, Sung-Mo Park, Sangwoo Park, Daeho ...
CISST
2003
83views Hardware» more  CISST 2003»
13 years 9 months ago
Computational Efficiency of Structural Image Matching
This paper addresses computational efficiency issues of a new algebraic method for imagery registration/conflation. An algebraic approach to conflation/registration of images does ...
Richard Chase, Boris Kovalerchuk
TKDE
2008
178views more  TKDE 2008»
13 years 7 months ago
Efficient Similarity Search over Future Stream Time Series
With the advance of hardware and communication technologies, stream time series is gaining ever-increasing attention due to its importance in many applications such as financial da...
Xiang Lian, Lei Chen 0002
WINE
2010
Springer
201views Economy» more  WINE 2010»
13 years 5 months ago
Efficient Computation of the Shapley Value for Centrality in Networks
The Shapley Value is arguably the most important normative solution concept in coalitional games. One of its applications is in the domain of networks, where the Shapley Value is u...
Karthik V. Aadithya, Balaraman Ravindran, Tomasz P...
AGP
1994
IEEE
13 years 12 months ago
What the Event Calculus actually does, and how to do it efficiently
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
Iliano Cervesato, Luca Chittaro, Angelo Montanari