Sciweavers

16257 search results - page 95 / 3252
» D-finiteness: algorithms and applications
Sort
View
ICDAR
2005
IEEE
14 years 2 months ago
Handwriting Matching and Its Application to Handwriting Synthesis
Since it is extremely expensive to collect a large volume of handwriting samples, synthesized data are often used to enlarge the training set. We argue that, in order to generate ...
Yefeng Zheng, David S. Doermann
CHES
2005
Springer
83views Cryptology» more  CHES 2005»
14 years 2 months ago
Fast Truncated Multiplication for Cryptographic Applications
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
Laszlo Hars
HICSS
2000
IEEE
150views Biometrics» more  HICSS 2000»
14 years 1 months ago
An Application of Text Mining: Bibliographic Navigator Powered by Extended Association Rules
In this paper, we discuss the implementation and performance of our developed bibliographic navigator with the text mining. We categorize the different attributes and extend the m...
Minoru Kawahara, Hiroyuki Kawano
ENTCS
2006
117views more  ENTCS 2006»
13 years 9 months ago
Distributed Graph Traversals by Relabelling Systems with Applications
Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and ...
Bilel Derbel, Mohamed Mosbah
HPDC
2005
IEEE
14 years 2 months ago
Cost-based scheduling for data-intensive applications on global grids
We present an algorithm for scheduling distributed data intensive Bag-of-Task applications on Data Grids that have costs associated with requesting, transferring and processing da...
Srikumar Venugopal, Rajkumar Buyya