Sciweavers

3678 search results - page 253 / 736
» On the Stable Paths Problem
Sort
View
CORR
2010
Springer
127views Education» more  CORR 2010»
15 years 1 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
TC
2008
15 years 6 months ago
The Synonym Lookaside Buffer: A Solution to the Synonym Problem in Virtual Caches
To support dynamic address translation in today's microprocessors, the first-level cache is accessed in parallel with a translation lookaside buffer (TLB). However, this curre...
Xiaogang Qiu, Michel Dubois
OSN
2007
185views more  OSN 2007»
15 years 5 months ago
Comparison of ILP formulations for the RWA problem
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
Brigitte Jaumard, Christophe Meyer, B. Thiongane
CVPR
2003
IEEE
16 years 8 months ago
Motion Deblurring Using Hybrid Imaging
Motion blur due to camera motion can significantly degrade the quality of an image. Since the path of the camera motion can be arbitrary, deblurring of motion blurred images is a ...
Moshe Ben-Ezra, Shree K. Nayar
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
15 years 11 months ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind