1160 search results - page 104 / 232 » Revisiting the Sequence Constraint |
174
click to vote
SIAMJO
2000
15 years 6 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...
175
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
In this report, we consider whether statistical regularities in natural images might be exploited to provide an improved selection criterion for interest points. One approach that ...
173
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
189
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
In this paper, we revisit the classical problem of functional decomposition [1, 2] that arises so often in logic synthesis. One basic problem that has remained largely unaddressed...
168
click to vote
JSAC
2007
15 years 6 months ago
2007
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...