692 search results - page 58 / 139 » BDD minimization for approximate computing |
85
Voted
FOCS
2007
IEEE
15 years 5 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
CVPR
2004
IEEE
16 years 28 days ago
2004
IEEE
We present a new variational framework for recovery of apparent diffusion coefficient (ADC) from High Angular Resolution Diffusion-weighted (HARD) MRI. The model approximates the ...
ICPR
2004
IEEE
16 years 10 hour ago
2004
IEEE
The objectives of the work described in this paper are simply stated: given examples of a particular person and an unlabelled video, we wish to find every instance of that person ...
103
Voted
PPSN
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Evolution Strategies, Evolutionary Algorithms based on Gaussian mutation and deterministic selection, are today considered the best choice as far as parameter optimizatio...
96
Voted
COMPGEOM
2005
ACM
15 years 26 days ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...