Sciweavers

2219 search results - page 344 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
135
Voted
PLDI
2006
ACM
15 years 8 months ago
A global progressive register allocator
This paper describes a global progressive register allocator, a register allocator that uses an expressive model of the register allocation problem to quickly find a good allocat...
David Ryan Koes, Seth Copen Goldstein
110
Voted
UAI
2003
15 years 3 months ago
Symbolic Generalization for On-line Planning
Symbolic representations have been used successfully in off-line planning algorithms for Markov decision processes. We show that they can also improve the performance of online p...
Zhengzhu Feng, Eric A. Hansen, Shlomo Zilberstein
APCSAC
2005
IEEE
15 years 8 months ago
Irregular Redistribution Scheduling by Partitioning Messages
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
Chang Yu, Ching-Hsien Hsu, Kun-Ming Yu, Chiu-Kuo L...
97
Voted
SPAA
1997
ACM
15 years 6 months ago
System Area Network Mapping
: This paper presents a network mapping algorithm and proves its correctness assuming a traffic-free network. Respecting well-defined parameters, the algorithm produces a graph iso...
Brent N. Chun, Alan M. Mainwaring, Saul Schleimer,...
ECCV
2010
Springer
15 years 2 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof