Sciweavers

334 search results - page 43 / 67
» A New Parallel Algorithm for Generalized LR Parsing
Sort
View
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
15 years 8 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
ICDCS
2010
IEEE
15 years 6 months ago
LT Network Codes
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
Mary-Luc Champel, Kévin Huguenin, Anne-Mari...
HPCN
1995
Springer
15 years 6 months ago
Discrete optimisation and real-world problems
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
Josef Kallrath, Anna Schreieck
152
Voted
ICDCS
2010
IEEE
15 years 12 days ago
Safe and Stabilizing Distributed Cellular Flows
Advances in wireless vehicular networks present us with opportunities for developing new distributed traffic control algorithms that avoid phenomena such as abrupt phase-transition...
Taylor Johnson, Sayan Mitra, Karthik Manamcheri
ICIP
2000
IEEE
15 years 6 months ago
EBWIC: A low Complexity and Efficient Rate Constrained Wavelet Image Coder
Efficient compression algorithms generally use wavelet transforms. They try to exploit all the signal dependencies that can appear inside and across the different sub-bands of th...
Christophe Parisot, Marc Antonini, Michel Barlaud