Sciweavers

3663 search results - page 172 / 733
» Problems in the ontology of computer programs
Sort
View
ICML
2006
IEEE
16 years 7 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty
ICIAR
2004
Springer
15 years 12 months ago
Reliable Dual-Band Based Contour Detection: A Double Dynamic Programming Approach
Finding contours in constrained search space is a well known problem. It is encountered in such areas as tracking objects in videos, or finding objects within defined boundaries....
Mohammad Dawood, Xiaoyi Jiang, Klaus P. Schäf...
EVOW
2009
Springer
16 years 1 months ago
A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse
We consider a real-world problem arising in a warehouse for spare parts. Items ordered by customers shall be collected and for this purpose our task is to determine efficient picku...
Matthias Prandtstetter, Günther R. Raidl, Tho...
ACG
2006
Springer
16 years 15 days ago
Recognizing Seki in Computer Go
Seki is a situation of coexistence in the game of Go, where neither player can profitably capture the opponent’s stones. This paper presents a new method for deciding whether an...
Xiaozhen Niu, Akihiro Kishimoto, Martin Mülle...
CCGRID
2002
IEEE
15 years 11 months ago
Symphony - A Java-Based Composition and Manipulation Framework for Computational Grids
We introduce the Symphony framework, a software ion layer that can sit on top of grid systems. Symphony provides a unified API for grid application developers and offers a graphic...
Markus Lorch, Dennis G. Kafura