Sciweavers

24 search results - page 3 / 5
» Replacement Paths via Fast Matrix Multiplication
Sort
View
SIAMNUM
2011
102views more  SIAMNUM 2011»
12 years 9 months ago
Differential Equations for Roaming Pseudospectra: Paths to Extremal Points and Boundary Tracking
Abstract. When studying the ε-pseudospectrum of a matrix, one is often interested in computing the extremal points having maximum real part or modulus. This is a crucial step, for...
Nicola Guglielmi, Christian Lubich
ASAP
2003
IEEE
155views Hardware» more  ASAP 2003»
13 years 11 months ago
Decimal Multiplication Via Carry-Save Addition
Decimal multiplication is important in many commercial applications including financial analysis, banking, tax calculation, currency conversion, insurance, and accounting. This p...
Mark A. Erle, Michael J. Schulte
ICDAR
2011
IEEE
12 years 5 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein
DSN
2005
IEEE
13 years 12 months ago
SMRP: Fast Restoration of Multicast Sessions from Persistent Failures
The growing reliance of networked applications on timely and reliable data transfer requires the underlying networking infrastructure to provide adequate services even in the pres...
Jian Wu, Kang G. Shin
ALGORITHMICA
2011
13 years 1 months ago
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Asaf Shapira, Raphael Yuster, Uri Zwick