Sciweavers

5153 search results - page 551 / 1031
» Introduction to Randomized Algorithms
Sort
View
COR
2010
146views more  COR 2010»
15 years 6 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
JUCS
2008
140views more  JUCS 2008»
15 years 6 months ago
Parallel Formulations of Scalar Multiplication on Koblitz Curves
We present an algorithm that by using the and -1 Frobenius operators concurrently allows us to obtain a parallelized version of the classical -and-add scalar multiplication algor...
Omran Ahmadi, Darrel Hankerson, Francisco Rodr&iac...
SIAMJO
2008
100views more  SIAMJO 2008»
15 years 6 months ago
On the Global Solution of Linear Programs with Linear Complementarity Constraints
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
Jing Hu, John E. Mitchell, Jong-Shi Pang, Kristin ...
ICCV
2009
IEEE
15 years 4 months ago
Learning with dynamic group sparsity
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas
ICIP
2000
IEEE
16 years 8 months ago
Flicker Reduction in Old Films
This paper deals with the reduction of flicker in old films. This artifact appears as global, quick and random variations of the luminance and contrast between consecutive frames ...
Valery Naranjo, Antonio Albiol