Sciweavers

895 search results - page 46 / 179
» Using graphs for some discrete tomography problems
Sort
View
COMPGEOM
2010
ACM
14 years 4 months ago
On degrees in random triangulations of point sets
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
Micha Sharir, Adam Sheffer, Emo Welzl
PODC
2006
ACM
14 years 4 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
SIAMNUM
2011
92views more  SIAMNUM 2011»
13 years 1 months ago
A Priori Mesh Grading for an Elliptic Problem with Dirac Right-Hand Side
The Green function of the Poisson equation in two dimensions is not contained in the Sobolev space H1(Ω) such that finite element error estimates for the discretization of a prob...
Thomas Apel, Olaf Benedix, Dieter Sirch, Boris Vex...
CORR
2008
Springer
71views Education» more  CORR 2008»
13 years 11 months ago
Problem Solving and Complex Systems
The observation and modeling of natural Complex Systems (CSs) like the human nervous system, the evolution or the weather, allows the definition of special abilities and models re...
Frédéric Guinand, Yoann Pigné
ICPR
2000
IEEE
14 years 12 months ago
Motion Estimation Using the Differential Epipolar Equation
We consider the motion estimation problem in the case of very closely spaced views. We revisit the differential epipolar equation providing an interpretation of it. On the basis o...
Luis Baumela, Lourdes de Agapito, Ian D. Reid, P. ...