Sciweavers

6365 search results - page 886 / 1273
» Fast Local Computation Algorithms
Sort
View
319
Voted
POPL
2003
ACM
16 years 7 months ago
Bitwidth aware global register allocation
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
Sriraman Tallam, Rajiv Gupta
RTCSA
2006
IEEE
16 years 1 months ago
Instruction Scheduling with Release Times and Deadlines on ILP Processors
ILP (Instruction Level Parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions may be subject to timing constraints. An optimisi...
Hui Wu, Joxan Jaffar, Jingling Xue
SIGCOMM
2012
ACM
13 years 10 months ago
Optimizing cost and performance for content multihoming
Many large content publishers use multiple content distribution networks to deliver their content, and many industrial systems have become available to help a broader set of conte...
Hongqiang Harry Liu, Ye Wang, Yang Richard Yang, H...
185
Voted
ECCV
2006
Springer
16 years 9 months ago
An Integral Solution to Surface Evolution PDEs Via Geo-cuts
We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a different...
Yuri Boykov, Vladimir Kolmogorov, Daniel Cremers, ...
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 8 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...