Sciweavers

7930 search results - page 331 / 1586
» Greedy in Approximation Algorithms
Sort
View
RTAS
2010
IEEE
15 years 5 months ago
Approximate Bandwidth Allocation for Fixed-Priority-Scheduled Periodic Resources
Recent research in compositional real-time systems has focused on determination of a component’s real-time interface parameters. An important objective in interface-parameter de...
Farhana Dewan, Nathan Fisher
CLEF
2010
Springer
15 years 1 months ago
FastDocode: Finding Approximated Segments of N-Grams for Document Copy Detection - Lab Report for PAN at CLEF 2010
Nowadays, plagiarism has been presented as one of the main distresses that the information technology revolution has lead into our society for which using pattern matching algorith...
Gabriel Oberreuter, Gaston L'Huillier, Sebasti&aac...
APPROX
2009
Springer
145views Algorithms» more  APPROX 2009»
16 years 1 months ago
Approximating Some Network Design Problems with Node Costs
We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...
Guy Kortsarz, Zeev Nutov
APPROX
2004
Springer
119views Algorithms» more  APPROX 2004»
16 years 2 days ago
Approximation Schemes for Broadcasting in Heterogenous Networks
We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor has transmission time , which is the time taken to send a message to any...
Samir Khuller, Yoo Ah Kim, Gerhard J. Woeginger
DCC
1993
IEEE
15 years 10 months ago
Minimizing Error and VLSI Complexity in the Multiplication-Free Approximation of Arithmetic Coding
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...
Gennady Feygin, P. Glenn Gulak, Paul Chow