Sciweavers

1013 search results - page 164 / 203
» A Subexponential Algorithm for Abstract Optimization Problem...
Sort
View
CPM
1998
Springer
115views Combinatorics» more  CPM 1998»
15 years 2 months ago
Aligning Alignments
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
John D. Kececioglu, Weiqing Zhang
EMMCVPR
2007
Springer
15 years 1 months ago
Efficient Shape Matching Via Graph Cuts
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...
CORR
2008
Springer
150views Education» more  CORR 2008»
14 years 9 months ago
Message-passing for Maximum Weight Independent Set
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
Sujay Sanghavi, Devavrat Shah, Alan S. Willsky
PPSN
2004
Springer
15 years 3 months ago
Indicator-Based Selection in Multiobjective Search
Abstract. This paper discusses how preference information of the decision maker can in general be integrated into multiobjective search. The main idea is to first define the opti...
Eckart Zitzler, Simon Künzli
FAST
2007
14 years 11 months ago
AMP: Adaptive Multi-stream Prefetching in a Shared Cache
Abstract— Prefetching is a widely used technique in modern data storage systems. We study the most widely used class of prefetching algorithms known as sequential prefetching. Th...
Binny S. Gill, Luis Angel D. Bathen