Sciweavers

3690 search results - page 69 / 738
» Computation with classical sequents
Sort
View
CAGD
2007
75views more  CAGD 2007»
14 years 9 months ago
Computing roots of polynomials by quadratic clipping
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...
Michael Barton, Bert Jüttler
ISCI
2006
136views more  ISCI 2006»
14 years 9 months ago
Computing with words for text processing: An approach to the text categorization
The use of the computing with words paradigm for the automatic text documents categorization problem is discussed. This specific problem of information retrieval (IR) becomes more...
Slawomir Zadrozny, Janusz Kacprzyk
MST
2008
150views more  MST 2008»
14 years 9 months ago
Coinduction for Exact Real Number Computation
This paper studies coinductive representations of real numbers by signed digit streams and fast Cauchy sequences. It is shown how the associated coinductive principle can be used ...
Ulrich Berger, Tie Hou
JCNS
2010
103views more  JCNS 2010»
14 years 4 months ago
Efficient computation of the maximum a posteriori path and parameter estimation in integrate-and-fire and more general state-spa
A number of important data analysis problems in neuroscience can be solved using state-space models. In this article, we describe fast methods for computing the exact maximum a pos...
Shinsuke Koyama, Liam Paninski
ICPR
2008
IEEE
15 years 11 months ago
Robust shape normalization based on implicit representations
We introduce a new shape normalization method based on implicit shape representations. The proposed method is robust with respect to deformations and invariant to similarity trans...
Carlo Tomasi, Tingting Jiang