64 search results - page 5 / 13 » Irreducible triangulations are small |
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
ISAAC
2004
Springer
14 years 29 days ago
2004
Springer
Given a planar triangulation all of whose faces are initially white, we study the problem of colouring the faces black one by one so that the boundary between black and white faces...
ACL
2007
13 years 9 months ago
2007
Current phrase-based SMT systems perform poorly when using small training sets. This is a consequence of unreliable translation estimates and low coverage over source and target p...
ICCV
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maxi...
ECSQARU
2009
Springer
14 years 2 months ago
2009
Springer
A BN2O network is a Bayesian network having the structure of a bipartite graph with all edges directed from one part (the top level) toward the other (the bottom level) and where a...