634 search results - page 60 / 127 » Groundwork for Weak Analysis |
111
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
105
Voted
CHES
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Balanced asynchronous circuits have been touted as a superior replacement for conventional synchronous circuits. To assess these claims, we have designed, manufactured an...
98
Voted
AGP
1999
IEEE
15 years 8 months ago
1999
IEEE
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...
128
Voted
ICPR
2006
IEEE
16 years 4 months ago
2006
IEEE
This paper generalizes the methods in a previous paper [10] in two ways. First, a more comprehensive analysis of the initialization problem of the Chan-Vese models is given. Secon...
113
Voted
IPMI
2003
Springer
16 years 4 months ago
2003
Springer
We formulate and interpret several registration methods in the context of a unified statistical and information theoretic framework. A unified interpretation clarifies the implici...