Results 1  10
of
1,763,228
Basecalling of automated sequencer traces using phred. I. Accuracy Assessment
 GENOME RES
, 1998
"... The availability of massive amounts of DNA sequence information has begun to revolutionize the practice of biology. As a result, current largescale sequencing output, while impressive, is not adequate to keep pace with growing demand and, in particular, is far short of what will be required to obta ..."
Abstract

Cited by 1608 (4 self)
 Add to MetaCart
The availability of massive amounts of DNA sequence information has begun to revolutionize the practice of biology. As a result, current largescale sequencing output, while impressive, is not adequate to keep pace with growing demand and, in particular, is far short of what will be required
Long Shortterm Memory
, 1995
"... "Recurrent backprop" for learning to store information over extended time intervals takes too long. The main reason is insufficient, decaying error back flow. We briefly review Hochreiter's 1991 analysis of this problem. Then we overcome it by introducing a novel, efficient method c ..."
Abstract

Cited by 394 (58 self)
 Add to MetaCart
called "Long Short Term Memory" (LSTM). LSTM can learn to bridge minimal time lags in excess of 1000 time steps by enforcing constant error flow through internal states of special units. Multiplicative gate units learn to open and close access to constant error flow. LSTM's update
Insertion sequences
 Microbiol Mol. Biol. Rev
, 1998
"... These include: Receive: RSS Feeds, eTOCs, free email alerts (when new articles cite this article), more» Downloaded from ..."
Abstract

Cited by 426 (3 self)
 Add to MetaCart
These include: Receive: RSS Feeds, eTOCs, free email alerts (when new articles cite this article), more» Downloaded from
Convergence of an infeasible shortstep pathfollowing algorithm based on the GaussNewton direction
, 2000
"... This short note proves the polynomial time convergence of a short step, approximate path following, interiorpoint primaldual algorithm for semidenite programs based on the GaussNewton direction obtained from minimizing the norm of the perturbed optimality conditions. This is the rst proof of conve ..."
Abstract
 Add to MetaCart
This short note proves the polynomial time convergence of a short step, approximate path following, interiorpoint primaldual algorithm for semidenite programs based on the GaussNewton direction obtained from minimizing the norm of the perturbed optimality conditions. This is the rst proof
CONVERGENCE OF A SHORTSTEP PRIMALDUAL ALGORITHM BASED ON THE GAUSSNEWTON DIRECTION
, 2003
"... We prove the theoretical convergence of a shortstep, approximate pathfollowing, interiorpoint primaldual algorithm for semidefinite programs based on the GaussNewton direction obtained from minimizing the norm of the perturbed optimality conditions. This is the first proof of convergence for the ..."
Abstract
 Add to MetaCart
We prove the theoretical convergence of a shortstep, approximate pathfollowing, interiorpoint primaldual algorithm for semidefinite programs based on the GaussNewton direction obtained from minimizing the norm of the perturbed optimality conditions. This is the first proof of convergence
LogGP: Incorporating Long Messages into the LogP Model  One step closer towards a realistic model for parallel computation
, 1995
"... We present a new model of parallel computationthe LogGP modeland use it to analyze a number of algorithms, most notably, the single node scatter (onetoall personalized broadcast). The LogGP model is an extension of the LogP model for parallel computation [CKP + 93] which abstracts the comm ..."
Abstract

Cited by 285 (1 self)
 Add to MetaCart
the communication of fixedsized short messages through the use of four parameters: the communication latency (L), overhead (o), bandwidth (g), and the number of processors (P ). As evidenced by experimental data, the LogP model can accurately predict communication performance when only short messages are sent (as
Hamming embedding and weak geometric consistency for large scale image search
 In ECCV
, 2008
"... Abstract. This paper improves recent methods for large scale image search. Stateoftheart methods build on the bagoffeatures image representation. We, first, analyze bagoffeatures in the framework of approximate nearest neighbor search. This shows the suboptimality of such a representation for ..."
Abstract

Cited by 324 (34 self)
 Add to MetaCart
consistency constraints as well as their efficiency. Estimation of the full geometric transformation, i.e., a reranking step on a short list of images, is complementary to our weak geometric consistency constraints and allows to further improve the accuracy. 1
2475–2479 This journal is © The Royal Society of Chemistry 2008 Pu bl ish ed o n M ar ch 8. D ow nl oa de d by P en ns yl va ni a St at e U ni ve rs ity o n /0
, 2008
"... First published as an Advance Article on the web 3rd January 2001 The electrochemical generation and characterisation of a variety of oquinodimethanes (oQDMs) are described together with the outcome of preparative experiments in which they are key intermediates. The quinodimethanes are convenientl ..."
Abstract

Cited by 339 (7 self)
 Add to MetaCart
First published as an Advance Article on the web 3rd January 2001 The electrochemical generation and characterisation of a variety of oquinodimethanes (oQDMs) are described together with the outcome of preparative experiments in which they are key intermediates. The quinodimethanes are conveniently formed, in DMF, by both direct and redoxcatalysed electroreduction of 1,2bis(halomethyl)arenes. Their predominant reaction is polymerisation to poly(oxylylene) (oPX) polymers. In the presence of dienophiles the electrogenerated oQDMs may undergo efficient cycloaddition reaction and distinctions between the possible mechanisms have been attempted on the basis of voltammetric, preparative and stereochemical experiments. Contrary to the precedent of the corresponding methyl ester, diphenyl maleate radicalanion isomerises only slowly to the fumarate radicalanion, yet coelectrolysis of 2,3bis(bromomethyl)1,4dimethoxybenzene and diphenyl maleate or diphenyl fumarate gives exclusively the corresponding transadduct. Coelectrolysis of dimethyl maleate with either 1,2bis(bromomethyl)benzene (more easily reduced) or 2,3bis(bromomethyl)1,4dimethoxybenzene (less easily reduced) gave only oPX polymer. The results are rationalised in terms of a double nucleophilic substitution mechanism where electron transfer between dienophile radicalanion and dihalide is relatively slow. Where electron transfer from maleate or fumarate radicalanions is likely to be fast oquinodimethanes are formed by redoxcatalysis and they polymerise rather than undergo Diels–Alder reaction. Dimerisation of the dienophile radicalanions, with k2 = 104 to 105 M1 s1, does not apparently compete with nucleophilic substitution or, where relevant, electron transfer.
FlowMap: An Optimal Technology Mapping Algorithm for Delay Optimization in LookupTable Based FPGA Designs
 IEEE TRANS. CAD
, 1994
"... The field programmable gatearray (FPGA) has become an important technology in VLSI ASIC designs. In the past a few years, a number of heuristic algorithms have been proposed for technology mapping in lookuptable (LUT) based FPGA designs, but none of them guarantees optimal solutions for general Bo ..."
Abstract

Cited by 317 (41 self)
 Add to MetaCart
Boolean networks and little is known about how far their solutions are away from the optimal ones. This paper presents a theoretical breakthrough which shows that the LUTbased FPGA technology mapping problem for depth minimization can be solved optimally in polynomial time. A key step in our algorithm
A potential reduction variant of Renegar's shortstep pathfollowing method for linear programming
, 1990
"... In this paper we propose a new polynomial potential reduction method for linear programming, which can also be seen as a largestep pathfollowing method. In our method we do an (approximate) linesearch along the Newton direction with respect to Renegar's strictly convex potential function if ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
In this paper we propose a new polynomial potential reduction method for linear programming, which can also be seen as a largestep pathfollowing method. In our method we do an (approximate) linesearch along the Newton direction with respect to Renegar's strictly convex potential function
Results 1  10
of
1,763,228