Sciweavers

814 search results - page 52 / 163
» Optimal pairings
Sort
View
HIPEAC
2009
Springer
14 years 4 months ago
Collective Optimization
Abstract. Iterative compilation is an efficient approach to optimize programs on rapidly evolving hardware, but it is still only scarcely used in practice due to a necessity to gat...
Grigori Fursin, Olivier Temam
JACIII
2008
148views more  JACIII 2008»
13 years 10 months ago
Optimal Route Based on Dynamic Programming for Road Networks
Abstract. One of the main functions of the traffic navigation systems is to find the optimal route to the destination. In this paper, we propose an iterative Q value updating algor...
Manoj Kanta Mainali, Kaoru Shimada, Shingo Mabu, K...
BIBE
2007
IEEE
128views Bioinformatics» more  BIBE 2007»
14 years 4 months ago
QOMA2: Optimizing the alignment of many sequences
Abstract—We consider the problem of aligning multiple protein sequences with the goal of maximizing the SP (Sum-of-Pairs) score, when the number of sequences is large. The QOMA (...
Xu Zhang, Tamer Kahveci
ICCV
2009
IEEE
1069views Computer Vision» more  ICCV 2009»
15 years 2 months ago
An efficient algorithm for Co-segmentation
This paper is focused on the Co-segmentation problem [1] – where the objective is to segment a similar object from a pair of images. The background in the two images may be ar...
Dorit S. Hochbaum, Vikas Singh
CCCG
2006
13 years 11 months ago
On Bipartite Matching under the RMS Distance
Given two sets A and B of n points each in R2 , we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. W...
Jeff M. Phillips, Pankaj K. Agarwal