Sciweavers

783 search results - page 52 / 157
» Improved approximation algorithms for the freeze-tag problem
Sort
View
ISSAC
1995
Springer
108views Mathematics» more  ISSAC 1995»
14 years 7 days ago
A Solution to the Extended GCD Problem
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
Bohdan S. Majewski, George Havas
TON
2008
119views more  TON 2008»
13 years 8 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
SIAMNUM
2010
103views more  SIAMNUM 2010»
13 years 3 months ago
Hybridization and Postprocessing Techniques for Mixed Eigenfunctions
Abstract. We introduce hybridization and postprocessing techniques for the RaviartThomas approximation of second-order elliptic eigenvalue problems. Hybridization reduces the Ravia...
Bernardo Cockburn, Jayadeep Gopalakrishnan, F. Li,...
PODS
2004
ACM
143views Database» more  PODS 2004»
14 years 8 months ago
Approximate Counts and Quantiles over Sliding Windows
We consider the problem of maintaining approximate counts and quantiles over fixed- and variablesize sliding windows in limited space. For quantiles, we present deterministic algo...
Arvind Arasu, Gurmeet Singh Manku
ASAP
2004
IEEE
185views Hardware» more  ASAP 2004»
14 years 13 days ago
Families of FPGA-Based Algorithms for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
Tom Van Court, Martin C. Herbordt