Sciweavers

448 search results - page 50 / 90
» Obstacle avoidance in formation
Sort
View
BXML
2004
15 years 5 months ago
Query Reformulation for the XML standards XPath, XQuery and XSLT
: Whenever transformation of data is used to bridge the gap of different data formats, and a query is given in the destination format, query reformulation can speed up the transfor...
Sven Groppe, Stefan Böttcher
CSC
2006
15 years 5 months ago
Implementation of RSA Based on Modified Montgomery Modular Multiplication Algorithm
- A modified Montgomery modular multiplication algorithm using four-to-two CSA (carry save adder) was proposed. The modified algorithm avoids the carry delay and the repeated outpu...
Gang Feng, Guang-Sheng Ma, Zhi Yang
WIDM
2003
ACM
15 years 9 months ago
XPath query transformation based on XSLT stylesheets
Whenever XML data must be shared by heterogeneous applications, transformations between different applicationspecific XML formats are necessary. The state-of-the-art method transf...
Sven Groppe, Stefan Böttcher
TCOM
2008
63views more  TCOM 2008»
15 years 4 months ago
A general construction of constrained parity-check codes for optical recording
This paper proposes a general and systematic code design method to efficiently combine constrained codes with parity-check (PC) codes for optical recording. The proposed constraine...
Kui Cai, Kees A. Schouhamer Immink
EJWCN
2010
115views more  EJWCN 2010»
14 years 11 months ago
Efficient Certification Path Discovery for MANET
A Mobile Ad Hoc Network (MANET) is characterized by the lack of any infrastructure, absence of any kind of centralized administration, frequent mobility of nodes, network partitio...
Georgios Kambourakis, Elisavet Konstantinou, Anast...