Sciweavers

2191 search results - page 272 / 439
» Improving the Efficiency of Non-Deterministic Computations
Sort
View
JDA
2008
72views more  JDA 2008»
13 years 9 months ago
Semi-local longest common subsequences in subquadratic time
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
Alexander Tiskin
JNW
2006
149views more  JNW 2006»
13 years 9 months ago
Authenticated AODV Routing Protocol Using One-Time Signature and Transitive Signature Schemes
Mobile ad hoc network (MANET) has been generally regarded as an ideal network model for group communications because of its specialty of instant establishment. However, the securit...
Shidi Xu, Yi Mu, Willy Susilo
EOR
2007
103views more  EOR 2007»
13 years 9 months ago
Alternative configurations for cutting machines in a tube cutting mill
In a steel tube mill where an endless stream of steel tube is supplied from a manufacturing facility, trim waste is never made regardless of cutting patterns used and the standard...
Iman Hajizadeh, Chi-Guhn Lee
SIGOPS
2008
104views more  SIGOPS 2008»
13 years 9 months ago
PipesFS: fast Linux I/O in the unix tradition
This paper presents PipesFS, an I/O architecture for Linux 2.6 that increases I/O throughput and adds support for heterogeneous parallel processors by (1) collapsing many I/O inte...
Willem de Bruijn, Herbert Bos
TCS
2008
13 years 9 months ago
On the complexity of real root isolation using continued fractions
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris