Sciweavers

15485 search results - page 417 / 3097
» Computing Optimal Subsets
Sort
View
149
Voted
DCC
2006
IEEE
15 years 10 months ago
Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs
Abstract. We address the problem of designing optimal prefix-free codes over an encoding alphabet with unequal integer letter costs. The most efficient algorithm proposed so far ha...
Sorina Dumitrescu
EUROPAR
2008
Springer
15 years 8 months ago
Bi-objective Approximation Scheme for Makespan and Reliability Optimization on Uniform Parallel Machines
We study the problem of scheduling independent tasks on a set of related processors which have a probability of failure governed by an exponential law. We are interested in the bi-...
Emmanuel Jeannot, Erik Saule, Denis Trystram
EUROPAR
2010
Springer
15 years 7 months ago
Optimized On-Chip-Pipelined Mergesort on the Cell/B.E
Abstract. Limited bandwidth to off-chip main memory is a performance bottleneck in chip multiprocessors for streaming computations, such as Cell/B.E., and this will become even mor...
Rikard Hultén, Christoph W. Kessler, Jö...
PAAPP
1998
149views more  PAAPP 1998»
15 years 6 months ago
Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
Sumanta Guha
CHI
2003
ACM
16 years 7 months ago
Mr.Web: an automated interactive webmaster
This paper describes a system, Mr.Web, designed to interact with users over email to create and update Web pages. Our goal is that users interact with Mr.Web as if it were a human...
Andrea Lockerd, Huy Pham, Taly Sharon, Ted Selker