692 search results - page 10 / 139 » BDD minimization for approximate computing |
DATE
2010
IEEE
15 years 5 months ago
2010
IEEE
—With the prospect of atomic-scale computing, we study cumulative energy profiles of spin-spin interactions in nonferromagnetic lattices (Ising spin-glasses)—an established to...
110
Voted
SIAMJO
2000
14 years 12 months ago
2000
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
123
click to vote
CIKM
2000
Springer
15 years 4 months ago
2000
Springer
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
102
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...