Sciweavers

Share
CSJM
2006
77views more  CSJM 2006»
9 years 5 months ago
An Approach to Shorten Digital Signature Length
A new method is proposed to design short signature schemes based on difficulty of factorizing a composite number n = qr, where q and r are two large primes. Using the method new d...
Nikolay A. Moldovyan
CSJM
2006
76views more  CSJM 2006»
9 years 5 months ago
Graph Coloring using Peer-to-Peer Networks
The popularity of distributed file systems continues to grow in last years. The reasons they are preferred over traditional centralized systems include fault tolerance, availabili...
Adrian Iftene, Cornelius Croitoru
CSJM
2006
81views more  CSJM 2006»
9 years 5 months ago
Nash equilibria set computing in finite extended games
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
Valeriu Ungureanu
CSJM
2006
79views more  CSJM 2006»
9 years 5 months ago
Generating Languages by P Systems with Minimal Symport/Antiport
It is known that P systems with two membranes and minimal symport/antiport rules are "almost" computationally complete as generators of number or vector sets. Interpreti...
Artiom Alhazov, Yurii Rogozhin
CSJM
2006
57views more  CSJM 2006»
9 years 5 months ago
Macroeconomic growth determining
E. Naval
CSJM
2006
59views more  CSJM 2006»
9 years 5 months ago
Traveling Salesman Problem with Transportation
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
Valeriu Ungureanu
CSJM
2006
124views more  CSJM 2006»
9 years 5 months ago
Text Classification Using Word-Based PPM Models
Text classification is one of the most actual among the natural language processing problems. In this paper the application of word-based PPM (Prediction by Partial Matching) mode...
Victoria Bobicev
CSJM
2006
66views more  CSJM 2006»
9 years 5 months ago
The ascertainment of the inflexion models for Romanian
A method to increase the degree of inflexion process automatization for Romanian is proposed.
Svetlana Cojocaru
CSJM
2006
82views more  CSJM 2006»
9 years 5 months ago
Linguistic Resources and Technologies for Romanian Language
This paper revises notions related to Language Resources and Technologies (LRT), including a brief overview of some resources developed worldwide and with a special focus on Roman...
Dan Cristea, Corina Forascu
CSJM
2006
114views more  CSJM 2006»
9 years 5 months ago
Cryptoschemes Based on New Signature Formation Mechanism
Several variants of new digital signature schemes (DSS) based on the discrete logarithm and factorization problems have been proposed. Considered DSS are characterized in that a n...
Alexander A. Moldovyan, Dmitriy N. Moldovyan, L. V...
books