Sciweavers

2853 search results - page 272 / 571
» Finding related tables
Sort
View
TEC
2008
93views more  TEC 2008»
15 years 6 months ago
An Artificial Immune System Heuristic for Generating Short Addition Chains
This paper deals with the optimal computation of finite field exponentiation, which is a well-studied problem with many important applications in the areas of error-correcting code...
Nareli Cruz Cortés, Francisco Rodríg...
TON
2008
125views more  TON 2008»
15 years 6 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
ETS
2002
IEEE
164views Hardware» more  ETS 2002»
15 years 6 months ago
Evaluating the usability of Web-based learning tools
Web-based learning tools provide integrated environments of various technologies to support diverse educators' and learners' needs via the Internet. This paper reports t...
Margaret-Anne D. Storey, B. Phillips, Mechthild Ma...
TMI
2002
115views more  TMI 2002»
15 years 6 months ago
Discretization of the Radon transform and of its inverse by spline convolutions
Abstract--We present an explicit formula for B-spline convolution kernels; these are defined as the convolution of several B-splines of variable widths and degrees . We apply our r...
Stefan Horbelt, Michael Liebling, Michael Unser
DAM
2008
140views more  DAM 2008»
15 years 6 months ago
The minimum spanning strong subdigraph problem is fixed parameter tractable
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
Jørgen Bang-Jensen, Anders Yeo