Sciweavers

90 search results - page 7 / 18
» A nontangential cutting plane algorithm
Sort
View
CVPR
2005
IEEE
14 years 9 months ago
OBJ CUT
In this paper we present a principled Bayesian method for detecting and segmenting instances of a particular object category within an image, providing a coherent methodology for ...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
14 years 7 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
INFOCOM
2009
IEEE
14 years 2 months ago
Assessing the Vulnerability of the Fiber Infrastructure to Disasters
—Communication networks are vulnerable to natural disasters, such as earthquakes or floods, as well as to physical attacks, such as an Electromagnetic Pulse (EMP) attack. Such r...
Sebastian Neumayer, Gil Zussman, Reuven Cohen, Eyt...
DCG
2008
64views more  DCG 2008»
13 years 7 months ago
Grid Vertex-Unfolding Orthogonal Polyhedra
An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a net, a connected planar piece with no overlaps. A grid unfolding allows addition...
Mirela Damian, Robin Y. Flatland, Joseph O'Rourke
FSTTCS
2004
Springer
14 years 26 days ago
Short-Cuts on Star, Source and Planar Unfoldings
When studying a 3D polyhedron, it is often easier to cut it open and atten in on the plane. There are several ways to perform this unfolding. Standard unfoldings which have been u...
Vijay Chandru, Ramesh Hariharan, Narasimha M. Kris...