Results 31 to 40 of about 2,755,381 (193)
Local analysis of Grauert-Remmert-type normalization algorithms [PDF]
, 2013 Normalization is a fundamental ring-theoretic operation; geometrically it resolves singularities in codimension one. Existing algorithmic methods for computing the normalization rely on a common recipe: successively enlarge the given ring in form an ...
Boehm, Janko +2 more
core +1 more source
Machine learning to analyze single-case data : a proof of concept [PDF]
, 2020 Visual analysis is the most commonly used method for interpreting data from singlecase designs, but levels of interrater agreement remain a concern.
Destras, Océane +2 more
core +1 more source
Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Analysis of ...
Valerie Berthe, Laurent Imbert
doaj +1 more source
The Bayesian Formulation of EIT: Analysis and Algorithms [PDF]
, 2016 We provide a rigorous Bayesian formulation of the EIT problem in an infinite dimensional setting, leading to well-posedness in the Hellinger metric with respect to the data. We focus particularly on the reconstruction of binary fields where the interface
Dunlop, Matthew M., Stuart, Andrew M.
core +3 more sources
On-line extensible bin packing with unequal bin sizes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Analysis of ...
Deshi Ye, Guochuan Zhang
doaj +1 more source
Comparison of matroid intersection algorithms for large circuit analysis [PDF]
, 1997 This paper presents two approaches to symbolic analysis of large analog integrated circuits via simplification during the generation of the symbolic expressions. Both techniques are examined from the point of view of matroid theory.
Fernández Fernández, Francisco Vidal +2 more
core +1 more source
Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Analysis of ...
Gregory Nuel
doaj +1 more source
Analysis of Grain’s Initialization Algorithm [PDF]
, 2008 In this paper, we analyze the initialization algorithm of Grain, one of the eSTREAM candidates which made it to the third phase of the project. We point out the existence of a sliding property in the initialization algorithm of the Grain family, and show that it can be used to reduce by half the cost of exhaustive key search (currently the most ...
De Cannière, Christophe +2 more
openaire +2 more sources
A Didactic Analysis of Functional Queues
Informatics in Education, 2011 When first introduced to the analysis of algorithms, students are taught how to assess the best and worst cases, whereas the mean and amortized costs are considered advanced topics, usually saved for graduates.
Christian RINDERKNECHT
doaj +1 more source
AGRA: analysis of gene ranking algorithms [PDF]
Bioinformatics, 2011 Abstract Summary: Often, the most informative genes have to be selected from different gene sets and several computer gene ranking algorithms have been developed to cope with the problem. To help researchers decide which algorithm to use, we developed the analysis of gene ranking algorithms (AGRA) system that offers a novel technique for
Kocbek, Simon +8 more
openaire +4 more sources