Sciweavers

207 search results - page 30 / 42
» Run-Time Switching Between Total Order Algorithms
Sort
View
JMIV
2007
122views more  JMIV 2007»
13 years 7 months ago
Fast Image Inpainting Based on Coherence Transport
High-quality image inpainting methods based on nonlinear higher-order partial differential equations have been developed in the last few years. These methods are iterative by natur...
Folkmar Bornemann, Tom März
ICCD
2008
IEEE
192views Hardware» more  ICCD 2008»
14 years 4 months ago
Energy-aware opcode design
— Embedded processors are required to achieve high performance while running on batteries. Thus, they must exploit all the possible means available to reduce energy consumption w...
Balaji V. Iyer, Jason A. Poovey, Thomas M. Conte
DICTA
2003
13 years 8 months ago
Fast Adaptive Algorithm for Time-Critical Color Quantization Application
Color quantization is the process of grouping n data points to k cluster. We proposed a new approach, based on Wu’s color quantization [6]. Our approach can significantly reduce ...
Kiattisin Kanjanawanishkul, Bunyarit Uyyanonvara
IPCO
1998
152views Optimization» more  IPCO 1998»
13 years 8 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz
APPROX
2006
Springer
109views Algorithms» more  APPROX 2006»
13 years 11 months ago
Dobrushin Conditions and Systematic Scan
We consider Glauber dynamics on finite spin systems. The mixing time of Glauber dynamics can be bounded in terms of the influences of sites on each other. We consider three parame...
Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum