Sciweavers

2957 search results - page 449 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
SC
2009
ACM
14 years 2 months ago
Plasma fusion code coupling using scalable I/O services and scientific workflows
In order to understand the complex physics of mother nature, physicist often use many approximations to understand one area of physics and then write a simulation to reduce these ...
Norbert Podhorszki, Scott Klasky, Qing Liu, Cipria...
VISUALIZATION
1994
IEEE
14 years 2 months ago
A Lattice Model for Data Display
We will try to address the need for a formal foundation for visualization by taking an analytic approach to defining D. Since an arbitrary function D: U V will not produce display...
William L. Hibbard, Charles R. Dyer, Brian E. Paul
SIGGRAPH
1995
ACM
14 years 1 months ago
Multiresolution analysis of arbitrary meshes
In computer graphics and geometric modeling, shapes are often represented by triangular meshes. With the advent of laser scanning systems, meshes of extreme complexity are rapidly...
Matthias Eck, Tony DeRose, Tom Duchamp, Hugues Hop...
NIPS
2007
13 years 11 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
BMCBI
2010
82views more  BMCBI 2010»
13 years 10 months ago
Genome-wide estimation of firing efficiencies of origins of DNA replication from time-course copy number variation data
Background: DNA replication is a fundamental biological process during S phase of cell division. It is initiated from several hundreds of origins along whole chromosome with diffe...
Huaien Luo, Juntao Li, Majid Eshaghi, Jianhua Liu,...