Sciweavers

1760 search results - page 25 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
OOPSLA
2010
Springer
13 years 6 months ago
A simple inductive synthesis methodology and its applications
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...
Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Moo...
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
13 years 11 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas
ICIP
2005
IEEE
14 years 9 months ago
The multiRANSAC algorithm and its application to detect planar homographies
A RANSAC based procedure is described for detecting inliers corresponding to multiple models in a given set of data points. The algorithm we present in this paper (called multiRAN...
Marco Zuliani, Charles S. Kenney, B. S. Manjunath
BMCBI
2010
182views more  BMCBI 2010»
13 years 7 months ago
L2-norm multiple kernel learning and its application to biomedical data fusion
Background: This paper introduces the notion of optimizing different norms in the dual problem of support vector machines with multiple kernels. The selection of norms yields diff...
Shi Yu, Tillmann Falck, Anneleen Daemen, Lé...
RAM
2008
IEEE
95views Robotics» more  RAM 2008»
14 years 2 months ago
A New Distance Algorithm and Its Application to General Force-Closure Test
This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative com...
Yu Zheng, Chee-Meng Chew