Sciweavers

584 search results - page 53 / 117
» On the Number of Halving Planes
Sort
View
CVPR
2010
IEEE
15 years 10 months ago
Toward Coherent Object Detection And Scene Layout Understanding
Detecting objects in complex scenes while recovering the scene layout is a critical functionality in many vision-based applications. Inspired by the work of [18], we advocate the ...
Yingze Bao, Min Sun, Silvio Savarese
BMCBI
2005
117views more  BMCBI 2005»
15 years 1 months ago
Graph-representation of oxidative folding pathways
Background: The process of oxidative folding combines the formation of native disulfide bond with conformational folding resulting in the native three-dimensional fold. Oxidative ...
Vilmos Ágoston, Masa Cemazar, Lászl&...
INFORMS
1998
100views more  INFORMS 1998»
15 years 1 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
LATIN
2010
Springer
15 years 8 months ago
Visiting a Sequence of Points with a Bevel-Tip Needle
Abstract. Many surgical procedures could benefit from guiding a bevel-tip needle along circular arcs to multiple treatment points in a patient. At each treatment point, the needle...
Steven Bitner, Yam Ki Cheung, Atlas F. Cook, Ovidi...
IWOCA
2009
Springer
104views Algorithms» more  IWOCA 2009»
15 years 8 months ago
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonida...