Sciweavers

4565 search results - page 114 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
CVPR
2012
IEEE
13 years 4 months ago
Online robust image alignment via iterative convex optimization
In this paper we study the problem of online aligning a newly arrived image to previously well-aligned images. Inspired by recent advances in batch image alignment using low rank ...
Yi Wu, Bin Shen, Haibin Ling
MST
2007
167views more  MST 2007»
15 years 1 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
EUROPAR
2005
Springer
15 years 8 months ago
Automatic Tuning of PDGEMM Towards Optimal Performance
Sophisticated parallel matrix multiplication algorithms like PDGEMM exhibit a complex structure and can be controlled by a large set of parameters including blocking factors and bl...
Sascha Hunold, Thomas Rauber
CORR
2004
Springer
111views Education» more  CORR 2004»
15 years 2 months ago
Coloring Meyniel graphs in linear time
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel grap...
Benjamin Lévêque, Frédé...
ALGORITHMICA
2010
159views more  ALGORITHMICA 2010»
15 years 2 months ago
Computing the Greedy Spanner in Near-Quadratic Time
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil M...