Sciweavers

2254 search results - page 202 / 451
» Computing the minimal covering set
Sort
View
IJCM
2002
97views more  IJCM 2002»
15 years 6 months ago
Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decompos...
Richard Bean, Diane Donovan, Abdollah Khodkar, Ann...
ICCV
2005
IEEE
16 years 8 months ago
Shape and Appearance Repair for Incomplete Point Surfaces
This paper presents a new surface content completion framework that can restore both shape and appearance from scanned, incomplete point set inputs. First, the geometric holes can...
Seyoun Park, Xiaohu Guo, Hayong Shin, Hong Qin
SIGGRAPH
2010
ACM
15 years 11 months ago
Triangle surfaces with discrete equivalence classes
We propose a technique that takes a triangulated surface as input and outputs a surface with the same topology but altered geometry such that each polygon falls into a set of disc...
Mayank Singh, Scott Schaefer
MM
2006
ACM
178views Multimedia» more  MM 2006»
16 years 19 days ago
Multimedia signal processing for behavioral quantification in neuroscience
While there have been great advances in quantification of the genotype of organisms, including full genomes for many species, the quantification of phenotype is at a comparatively...
Peter Andrews, Haibin Wang, Dan Valente, Jih&egrav...
IPCO
2001
184views Optimization» more  IPCO 2001»
15 years 8 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner