Sciweavers

406 search results - page 20 / 82
» The Computation and Application of the Generalized Inverse v...
Sort
View
IJCAI
2001
13 years 9 months ago
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...
ECCV
2002
Springer
14 years 9 months ago
What Energy Functions Can Be Minimized via Graph Cuts?
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Vladimir Kolmogorov, Ramin Zabih
CVPR
2010
IEEE
14 years 3 months ago
Efficient Additive Kernels via Explicit Feature Maps
Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied...
Andrea Vedaldi, Andrew Zisserman
HPDC
2007
IEEE
13 years 11 months ago
Transparent network services via a virtual traffic layer for virtual machines
We claim that network services can be transparently added to existing unmodified applications running inside virtual machine environments. Examples of these network services inclu...
John R. Lange, Peter A. Dinda
ICPR
2004
IEEE
14 years 8 months ago
Towards Surface Regularization via Medial Axis Transitions
The reconstruction of objects from data in practical applications often leads to surfaces with small perturbations and other artifacts which make the detection of their ridges and...
Frederic F. Leymarie, Benjamin B. Kimia, Peter J. ...