74 search results - page 12 / 15 » Algorithms for Generating Convex Sets in Acyclic Digraphs |
104
Voted
SIGGRAPH
1996
ACM
15 years 4 months ago
1996
ACM
Scratches on old films must be removed since these are more noticeable on higher definition and digital televisions. Wires that suspend actors or cars must be carefully erased dur...
VR
2008
IEEE
15 years 6 months ago
2008
IEEE
Registration errors between the physical world and computergenerated objects are a central problem in Augmented Reality (AR) systems. Some existing AR systems have demonstrated ho...
101
click to vote
BMCBI
2007
15 years 14 days ago
2007
Background: A microarray study may select different differentially expressed gene sets because of different selection criteria. For example, the fold-change and p-value are two co...
BMCBI
2008
15 years 14 days ago
2008
Background: Microarray experiments generate vast amounts of data. The functional context of differentially expressed genes can be assessed by querying the Gene Ontology (GO) datab...
102
click to vote
CPAIOR
2010
Springer
15 years 3 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...