Sciweavers

203 search results - page 8 / 41
» On Inducing Polygons and Related Problems
Sort
View
COMGEO
2006
ACM
13 years 8 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
CSL
2003
Springer
14 years 1 months ago
Constraint Satisfaction with Countable Homogeneous Templates
For a fixed countable homogeneous relational structure Γ we study the computational problem whether a given finite structure of the same signature homomorphically maps to Γ. T...
Manuel Bodirsky, Jaroslav Nesetril
BMCBI
2005
119views more  BMCBI 2005»
13 years 8 months ago
The distance-profile representation and its application to detection of distantly related protein families
Background: Detecting homology between remotely related protein families is an important problem in computational biology since the biological properties of uncharacterized protei...
Chin-Jen Ku, Golan Yona
ICCSA
2003
Springer
14 years 1 months ago
Web Visualization of Function-Defined Shapes
Abstract. This paper describes how function-based shape modeling can be expanded to web visualization, as well as how web-based visualization can be greatly improved by using the f...
Alexei Sourin, Lai Feng Min, Konstantin Levinski
ACSD
2005
IEEE
71views Hardware» more  ACSD 2005»
14 years 2 months ago
Two-Phase Distributed Observation Problems
We introduce and study problems of distributed observation with bounded or unbounded memory. We are given a system modeled as a finite-word language L over some finite alphabet ...
Stavros Tripakis