Sciweavers

52 search results - page 9 / 11
» On the computational complexity of strong edge coloring
Sort
View
EUROGRAPHICS
2010
Eurographics
14 years 1 months ago
Practical quad mesh simplification
n this paper we present an innovative approach to incremental quad mesh simplification, i.e. the task of producing a low complexity quad mesh starting from a high complexity one. T...
Marco Tarini, Nico Pietroni, Paolo Cignoni, Daniel...
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
13 years 6 months ago
Computing Minimal Spanning Subgraphs in Linear Time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
AVSS
2009
IEEE
13 years 6 months ago
Object Tracking from Unstabilized Platforms by Particle Filtering with Embedded Camera Ego Motion
Visual tracking with moving cameras is a challenging task. The global motion induced by the moving camera moves the target object outside the expected search area, according to th...
Carlos R. del-Blanco, Narciso N. García, Lu...
ICIP
1998
IEEE
14 years 7 months ago
Generalized Distance based Matching of Nonbinary Images
We develope a technique to perform e cient and accurate matching to detect the occurences of a template in a scene. The template may describe an object or a textured surface. Repr...
Bülent Sankur, Cenk Köse, Valery V. Star...
ISBI
2009
IEEE
14 years 10 days ago
Structural Annotation of EM Images by Graph Cut
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...
Hang Chang, Manfred Auer, Bahram Parvin