Sciweavers

2489 search results - page 338 / 498
» On the Subgroup Distance Problem
Sort
View
ISBRA
2009
Springer
15 years 10 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
ACCV
2006
Springer
15 years 5 months ago
Learning Multi-category Classification in Bayesian Framework
Abstract. We propose an algorithm for Sparse Bayesian Classification for multi-class problems using Automatic Relevance Determination(ARD). Unlike other approaches which treat mult...
Atul Kanaujia, Dimitris N. Metaxas
COMPGEOM
2011
ACM
14 years 7 months ago
Deconstructing approximate offsets
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...
SODA
2012
ACM
229views Algorithms» more  SODA 2012»
13 years 6 months ago
Approximation algorithms for stochastic orienteering
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath ...
165
Voted
CVPR
2009
IEEE
16 years 11 months ago
Reconstructing Sharply Folding Surfaces: A Convex Formulation
In recent years, 3D deformable surface reconstruction from single images has attracted renewed interest. It has been shown that preventing the surface from either shrinking or s...
Mathieu Salzmann (University of California, Berkel...