Sciweavers

2374 search results - page 144 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
15 years 6 months ago
Optimal Random Matchings on Trees and Applications
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
Jeff Abrahamson, Béla Csaba, Ali Shokoufand...
173
Voted
TASE
2011
IEEE
14 years 8 months ago
Fast Intersection-Free Offset Surface Generation From Freeform Models With Triangular Meshes
Abstract—A fast offset surface generation approach is presented in this paper to construct intersection-free offset surfaces, which preserve sharp features, from freeform triangu...
Shengjun Liu, Charlie C. L. Wang
ICDCS
2003
IEEE
15 years 10 months ago
Optimal Distribution Tree for Internet Streaming Media
Internet radio and television stations require significant bandwidth to support delivery of high quality audio and video streams to a large number of receivers. IP multicast is a...
Min Sik Kim, Simon S. Lam, Dong-Young Lee
109
Voted
HPCA
2005
IEEE
16 years 5 months ago
Distributing the Frontend for Temperature Reduction
Due to increasing power densities, both on-chip average and peak temperatures are fast becoming a serious bottleneck in processor design. This is due to the cost of removing the h...
Antonio González, Grigorios Magklis, Jos&ea...
161
Voted
ICPADS
2006
IEEE
15 years 10 months ago
Fast Convergence in Self-Stabilizing Wireless Networks
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
Nathalie Mitton, Eric Fleury, Isabelle Guér...