Sciweavers

3454 search results - page 425 / 691
» Modern computer algebra
Sort
View
ACCV
2007
Springer
15 years 10 months ago
Efficiently Solving the Fractional Trust Region Problem
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...
Anders P. Eriksson, Carl Olsson, Fredrik Kahl
AAAI
1993
15 years 7 months ago
Numeric Reasoning with Relative Orders of Magnitude
In [Dague, 1993], a formal system ROM(K) involving four relations has been defined to reason with relative orders of magnitude. In this paper, problems of introducing quantitative...
Philippe Dague
ENTCS
2006
153views more  ENTCS 2006»
15 years 6 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu
CAD
1999
Springer
15 years 5 months ago
Set-combinations of the mixed-dimension cellular objects of the Djinn API
This paper is concerned with the mathematics and formal specification of "set-like" operations for the mixed dimension cellular objects of the Djinn Application Programm...
Alan E. Middleditch, Chris Reade, Abel J. P. Gomes
MST
1998
76views more  MST 1998»
15 years 5 months ago
Sharply Bounded Alternation and Quasilinear Time
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith