Sciweavers

3206 search results - page 599 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
14 years 1 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
PR
2011
13 years 2 months ago
A sum-over-paths extension of edit distances accounting for all sequence alignments
This paper introduces a simple Sum-over-Paths (SoP) formulation of string edit distances accounting for all possible alignments between two sequences, and extends related previous...
Silvia García-Díez, François ...
CVPR
2012
IEEE
11 years 10 months ago
A learning-based framework for depth ordering
Depth ordering is instrumental for understanding the 3D geometry of an image. We as humans are surprisingly good ordering even with abstract 2D line drawings. In this paper we pro...
Zhaoyin Jia, Andrew C. Gallagher, Yao-Jen Chang, T...
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 8 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
SIGMETRICS
2005
ACM
100views Hardware» more  SIGMETRICS 2005»
14 years 1 months ago
On AS-level path inference
The ability to discover the AS-level path between two end-points is valuable for network diagnosis, performance optimization, and reliability enhancement. Virtually all existing t...
Zhuoqing Morley Mao, Lili Qiu, Jia Wang, Yin Zhang