Sciweavers

7648 search results - page 1017 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
CVPR
2010
IEEE
16 years 2 months ago
Learning Full Pairwise Affinities for Spectral Segmentation
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
Tae Hoon Kim (Seoul National University), Kyoung M...
133
Voted
WINE
2009
Springer
138views Economy» more  WINE 2009»
16 years 27 days ago
Covering Games: Approximation through Non-cooperation
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
Martin Gairing
SLS
2009
Springer
243views Algorithms» more  SLS 2009»
16 years 25 days ago
Estimating Bounds on Expected Plateau Size in MAXSAT Problems
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitle...
IPPS
2007
IEEE
16 years 18 days ago
Reconfigurable Architecture for Biological Sequence Comparison in Reduced Memory Space
DNA sequence alignment is a very important problem in bioinformatics. The algorithm proposed by Smith-Waterman (SW) is an exact method that obtains optimal local alignments in qua...
Azzedine Boukerche, Jan Mendonca Correa, Alba Cris...
DAC
2005
ACM
15 years 8 months ago
Timing-driven placement by grid-warping
Grid-warping is a recent placement strategy based on a novel physical analogy: rather than move the gates to optimize their location, it elastically deforms a model of the 2-D chi...
Zhong Xiu, Rob A. Rutenbar
« Prev « First page 1017 / 1530 Last » Next »