Search

13 Mar 2018: Performance. By observing feedback from the robot, the op- erator is able to position the gripper to within lcm: sufficient accuracy to instruct it to pick up n small wootlcn Ilock

13 Mar 2018: "!# $%& %'()#,&-##)./10324 56&-786&9: ;#<: =;#: >?@-<;A66"B9: ;#<: =;#: >? C<DFEGHIJBGKMLONQPLSRLTU(VQLP LXWZYQ[&R]ARR[&T_T_UVALO]QRLOBaNFLPSL=NQU ]bWBcdP ]QNA[eTAdfUf[&ghNQPBiLRU P]QSU]QP LjWBTQYhLdghU[&ThPLBiLP kXWlc&dP

9 Aug 2005: "!# $%& %'()#,&-##)./10324 56&-786&9: ;#<: =;#: >?@-<;A66"B9: ;#<: =;#: >? C<DFEGHIJBGKMLONQPLSRLTU(VQLP LXWZYQ[&R]ARR[&T_T_UVALO]QRLOBaNFLPSL=NQU ]bWBcdP ]QNA[eTAdfUf[&ghNQPBiLRU P]QSU]QP LjWBTQYhLdghU[&ThPLBiLP kXWlc&dP

10 Aug 1999: This goal is achieved by solving an op-timization problem by numerical techniques, searching di-rectly for the intrinsic parameters of the cameras, instead ofthe indirect search performed by the algorithms

20 Feb 2018: ruleset = ruledef";" { ruledef ";" } {dbasefile}ruledef = lassdef | lexdef lassdef = lassinst "->" [sub lass [ lassbody [ ond [prob lassbody = "(" [opt member { "," [opt member } ")"lexdef = lassinst "=" "(" atom[prob {"|" atom[prob ")"prob = "{"

20 Feb 2018: Note that the reward model and the dialogue policy are being jointly op-timised during the sequence of dialogues.

19 Mar 2006: The optimal. values were found to be2.3 and6.2 for visual data; the op-timal filter for thermal data was found to be alow-passfilterwith W2 = 2.8 (i.e.

9 Aug 2005: 1.3. ComputingThe HMM-ANN approach is very computationally expensive.The networks currently require about 1013 floating point op-erations to train and future estimates of the required computepower is one

13 Mar 2018: engineering or graph op-timisation. ... This demonstrates that learning with the op-timum scale factor leads to the convnet uncovering a more accuratepose function.

9 Aug 2005: b)yogP_SYjEogZEV=FPWnco,o4o%PSpNV]acV=V]ZRoMLV j@oMRQ6NHTVV=b)oP_SRaRKP_aOaQTLYVqtKZnSaQTLYV )@=KgZNVOSV]¢HZEV=SKWog6To,rsVqtT<j Ë!TtqÍFNnKZnS. ... O<_OJKMLONHPRQTSUWVX[ZHQ6MV]P_QTacb dfZEUgQ6ZEV=V]PRQ6ZEU hiV]jnKP_aRLYV]ZHaâk8VrHZQTrKgV]j@oP_acDM«

22 Nov 2006: Theseallow high-dimensional kernel feature-spaces to be de-fined and calculated using only simple transducer op-erations on discrete sequences (or lattices) of observa-tions.

9 Aug 2005: l>SZ'C< 3)OP@j- /);@)f;@!;@j7r) V h[H&M5@)(Af)(>-@ 5 I "HI@EHH)&O})(47)7O;<<?@)(9jAf @@Af3)VX C 3 I"j#f@B < f@C# ... Hl@H-)( (B )(.>#B 4P47(#;47(,4> '6:>o6; H(# q>9Km>o. @#>19I. #AY[>oP>o6;-<V<>_$@E3SRTA6CSÇ4(-Vdf)(T3)&H-mKMC (-"!IC5O})(/H-)( &)(&J!

23 Feb 2006: HU }. Various levels of informationcan be propagated. 1. No information: The lower bound for allU utterances is op-timised.

9 Aug 2005: This minimal amount of parameter optimisation per iteration was necessary to ensure smooth convergence to an op-timal set of input values, and the MSE decreased during training from 1.5007

8 Aug 2005: Horses were investigatedbriefly in [7] but poor results were obtained. 3Note that ROC curves are not ideal for the task of detection, as op-posed to classification; see [1] for more

23 Feb 2006: The op-erating point selected for this work was to use the 1 hour of Englishdata from the TDT4 Mandarin source, along with 10 hours of datafrom the TDT4 English data.

19 Oct 2012: ALGORITHM WITHOUT /WITH OP TIMIS ING θ AND 1-S LACK ALGORITHMSWITHOUT/WITH GAUS S IAN P RIOR(A LG.

8 Aug 2005: 2.5.1 Improving Registration. In the registration method proposed in Section 2.2, the op-timal warp parameters were estimated from 3 point corre-spondences in 2D.

13 Mar 2018: 22WVlA = -V2U. (4). Here V and V2 are dimensionless projection op-erators involving combinations of projections intoimage and surface tangent planes.

9 Oct 2003: The first, called ”who spoke when”consists of automatically producing a series of start/end time marks with associated speaker (and op-tionally gender) labels. ... The RT-03s diarisation evaluation focused only on producing a segmentation with