1659 search results - page 233 / 332 » From Functional Analysis to Iterative Methods |
138
click to vote
IMR
2003
Springer
15 years 7 months ago
2003
Springer
This paper proposes a method for predicting the complexity of meshing Computer Aided Design (CAD) geometries with unstructured, hexahedral, finite elements. Meshing complexity ref...
121
click to vote
DATE
2000
IEEE
15 years 7 months ago
2000
IEEE
The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification. SAT has bee...
111
Voted
BMCBI
2007
15 years 2 months ago
2007
Background: Chromatin immunoprecipitation combined with DNA microarrays (ChIP-chip) is a high-throughput assay for DNA-protein-binding or post-translational chromatin/histone modi...
148
click to vote
SCIA
2009
Springer
15 years 9 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
226
Voted
CVPR
2012
IEEE
13 years 4 months ago
2012
IEEE
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...