358 search results - page 38 / 72 » Ten More Unsolved Problems in Computer Graphics |
GD
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. One of the most popular graph drawing methods is based on achieving graph-theoretic target distances. This method was used by Kamada and Kawai [15], who formulated it as ...
CCGRID
2010
IEEE
13 years 9 months ago
2010
IEEE
Finite difference methods continue to provide an important and parallelisable approach to many numerical simulations problems. Iterative multigrid and multilevel algorithms can co...
APGV
2004
ACM
14 years 7 days ago
2004
ACM
In this paper, we consider the problem of determining feature saliency for 3D objects and describe a series of experiments that examined if salient features exist and can be predi...
BMCBI
2007
2007
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
13 years 8 months ago
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
BMCBI
2007
13 years 8 months ago
2007
Background: Genome assemblers have grown very large and complex in response to the need for algorithms to handle the challenges of large whole-genome sequencing projects. Many of ...