Sciweavers

7092 search results - page 526 / 1419
» Parallelizing constraint programs
Sort
View
ICIP
2001
IEEE
16 years 6 months ago
Optimal radial contour tracking by dynamic programming
A common problem in most active contour methods is that the recursive searching scheme can only return a local optimal solution. Furthermore, the internal energy of the snake is n...
Yunqiang Chen, Thomas S. Huang, Yong Rui
CADE
2001
Springer
16 years 4 months ago
Termination and Reduction Checking for Higher-Order Logic Programs
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
Brigitte Pientka
IJCNN
2006
IEEE
15 years 10 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
138
Voted
COMPSAC
2005
IEEE
15 years 10 months ago
Goal-Oriented Test Data Generation for Programs with Pointer Variables
Automatic test data generation leads to the identification of input values on which a selected path or a selected branch is executed within a program (path-oriented vs goalorient...
Arnaud Gotlieb, Tristan Denmat, Bernard Botella
SIGOPSE
2004
ACM
15 years 10 months ago
Using virtual markets to program global behavior in sensor networks
This paper presents market-based macroprogramming (MBM), a new paradigm for achieving globally efficient behavior in sensor networks. Rather than programming the individual, low-...
Geoffrey Mainland, Laura Kang, Sébastien La...