Sciweavers

4488 search results - page 743 / 898
» Properties of NP-Complete Sets
Sort
View
COMPUTING
2004
125views more  COMPUTING 2004»
13 years 9 months ago
Robust Spherical Parameterization of Triangular Meshes
Parameterization of 3D mesh data is important for many graphics and mesh processing applications, in particular for texture mapping, remeshing and morphing. Closed, manifold, genu...
Alla Sheffer, Craig Gotsman, Nira Dyn
CVIU
2004
115views more  CVIU 2004»
13 years 9 months ago
Dynamic learning from multiple examples for semantic object segmentation and search
We present a novel ``dynamic learning'' approach for an intelligent image database system to automatically improve object segmentation and labeling without user interven...
Yaowu Xu, Eli Saber, A. Murat Tekalp
ALGORITHMICA
2000
87views more  ALGORITHMICA 2000»
13 years 9 months ago
Linear Size Binary Space Partitions for Uncluttered Scenes
We describe a new and simple method for constructing binary space partitions in arbitrary dimensions. We also introduce the concept of uncluttered scenes, which are scenes with a ...
Mark de Berg
COMBINATORICS
2000
72views more  COMBINATORICS 2000»
13 years 9 months ago
Tournament Sequences and Meeussen Sequences
A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 2ti. A Meeussen sequence is an increasing sequence of positive inte...
Matthew Cook, Michael Kleber
COMBINATORICS
2000
124views more  COMBINATORICS 2000»
13 years 9 months ago
Colouring Planar Mixed Hypergraphs
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
André Kündgen, Eric Mendelsohn, Vitaly...