Sciweavers

328 search results - page 22 / 66
» Simple Termination Revisited
Sort
View
ASIACRYPT
2008
Springer
13 years 9 months ago
Twisted Edwards Curves Revisited
This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a ...
Hüseyin Hisil, Kenneth Koon-Ho Wong, Gary Car...
DAS
2008
Springer
13 years 9 months ago
Difference of Boxes Filters Revisited: Shadow Suppression and Efficient Character Segmentation
A robust segmentation is the most important part of an automatic character recognition system (e.g. document processing, license plate recognition etc.). In our contribution we pr...
Erik Rodner, Herbert Süße, Wolfgang Ort...
TPLP
2008
89views more  TPLP 2008»
13 years 7 months ago
Theory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...
CANDC
2004
ACM
13 years 7 months ago
Cycling in ecological networks: Finn's index revisited
A chief cybernetic feature of natural living systems is the recycling of nutrients, which tends to enhance stability and is one of the principal causes of ecosystem complexity. In...
Stefano Allesina, Robert E. Ulanowicz
CPC
2004
98views more  CPC 2004»
13 years 7 months ago
And/Or Trees Revisited
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
Brigitte Chauvin, Philippe Flajolet, Danièl...