Search

9 Aug 2005: pGj#G.G[_e 03TCOrpVc#<6. ) (y #@(0T8:Op r3TCKG[:f_( gO+fOnj:0O j O&(0/3O CTC0yJK(Oe9Zn. RO. ... OLF 8&F(iGJK}gO8)Y/0 o 9_90 :d 0 Op(O0. 3y(0COY #DViL @1{0y =C 03TCOC(OlO.

21 Nov 2006: In these situations, an op-timal hyperplane is found to minimise the probabilityof error, averaged over the training set.

9 Aug 2005: "!#$%&"'(%&). ,-/.1023435.67398 :9.<;>=3@?<ACBDE3 0-/FG3@HIHJ:KLACFM:NBDEOAC.PD3NQR.6@-I.ACASB-I.6T.-IU4ACBWVX-/DXYZ3NQ[0:9O?B-];P65A. 0:NO?B-J;65AZ0_[ aSbdce<R.6@H]:9.<;. fghji9k9lm5in&o9prqPs5tus5vwxCvXqzy

14 Sep 2006: Now the problem of finding an op-timal replacement of pixels in patch p′ from those in patch m′ is equivalent to finding apath in the graph such that the error

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

8 Aug 2005: Filtering Using a Tree-Based Estimator. B. Stenger A. Thayananthan P. H. S. Torr† R. Cipolla. University of Cambridge † Microsoft Research Ltd.Department of Engineering 7 JJ Thompson AvenueCambridge, CB2 1PZ, UK Cambridge, CB3 OFB, UK.

20 Feb 2018: However, to generate an appropriate response it is onlynecessary for the system to decide between a few high level op-tions such as to confirm the last user input, ask for

9 Aug 2005: Thus, although the baseline systems were op-timised over a limited range of thresholds, the figures obtainedare still susceptible to some degree of noise.

20 Feb 2018: The advantage of this approach is that the op-timal transformation parameters can be determinedfrom the auxiliary function in a single pass over thedata[63].

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

11 Nov 2005: understanding andsupporting the goals of people highlights the rich op-portunities ahead for harnessing probability and utilityat the computer{human interface.

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

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

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.

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

9 Aug 2005: õ èRéüËàbé_ßAâmÛ;âmÛ;òP @.&! / # # $#wRêèRäiÑ,4,Û;èPÑ@Ð,ð;ðTÑ 437 ;Ð0PÐ.22,;Ñ. mÐ41 3 ' ébÜwâmÞßAÛT0> 8ÂâmÛ;òRâmÛ;òýôå,ð8ÜwébðäßáÛ;ÜwëVíèRé4éÜwòRéÜwëiæëbâmèRÛT8ãwäZßáëbëbâ Pã

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.

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

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

13 Mar 2018: This op- timisation takes into account image gradient in- formation and modifies image point coordinates in order t o position primitive edges along image edges.

21 Sep 2006: Figure 11 illustrates the op-eration of the classifiers at different levels of the tree.

13 Mar 2018: The tworight columns show the update actions whichmust be performed for the desired tracking op-eration.

16 Jun 2015: They are thereforedefined as 1 , /0 = and 0 , /. 3.1.1. Implementation. The data structures used to implement the automata and the op-erations on them are best expressed mathematically.

20 Feb 2018: actions. The policy op-timisation is performed in interaction with a simulated user which gives a reward to the systemat the end of every dialogue.

13 Mar 2018: The reconstructed surface is obtained by solving the op-timisation. Smin = arg minSC. ... Ourmethod has no concept of a current surface during the op-timisation phase, and therefore has to make the visibilityassumption of section 3.

10 Oct 2007: Thus the C2W segmentations differed. Interms of hypotheses combination there are two possible levels to op-erate at.

10 Oct 2007: The selected data are addedto the original training dataset to update the acoustic model and op-tionally the language model [3, 1, 4].

13 Mar 2018: Hand Tracking Using A Quadric Surface Model. R. Cipolla1 B. Stenger1 A. Thayananthan1 P. H. S. Torr2. 1 University of Cambridge, Department of Engineering, Trumpington Street,Cambridge, CB2 1PZ, UK. 2 Microsoft Research Ltd., 7 J J Thomson Ave,

4 Aug 2009: reflectivity function despite the use of almost the same PSF for both forward and backward op-.

13 Mar 2018: If the angles of the epipolar lines had op-posite signals in respect the horizontal axis, the points putunder correspondence by the epipolar geometry would be atopposite places in the bottom

13 Mar 2018: Figure 11 illustrates the op-eration of the classifiers at different levels of the tree.

13 Mar 2018: path-length. to train data i.e. good generalisation, however, it is not op-timal in classification time. ... 2008). Random kitchen sinks: replacing op-timization with randomization in learning. In Proc.

13 Mar 2018: Huffman coding [17] is related to our op-timisation. It minimises the weighted (by region prior in our problem) path length of code(region).

13 Mar 2018: Our implementation has been optimizedfor speed at an algorithmic level by use of second order op-timizers, and by limiting the number of polygon clippingsrequired, but has not been micro-optimized.

8 Mar 2000: "#$%& (' ) ,-. /&. 02143517698:8:;=<?>A@B;:CED:FHG=1IGJ1LKM;ONP<I<QDRF7ST1VU&>AWX@YCZF2[M1]1_(8:8AabNbCcFdST1]e.1fgWhNZiR<jNcakCRFml&1MSonpNcaRqcCsr$t21u691wvx176zyOW|{}{h>qNcakC. CuL&ujd7?PRb?EjoPPuj&7PpAbbs:OPuBjok9JkuPPPL&ujoL¡

13 Mar 2018: Hand Tracking Using A Quadric Surface Model. R. Cipolla1 B. Stenger1 A. Thayananthan1 P. H. S. Torr2. 1 University of Cambridge, Department of Engineering, Trumpington Street,Cambridge, CB2 1PZ, UK. 2 Microsoft Research Ltd., 7 J J Thomson Ave,

13 Mar 2018: Having maximised the likelihood of each primitive, amodel selection criterion is used to decide whether the op-tional parameters A?

9 Aug 2005: #"$ %&' )( ,. -/.1024365 78.:9;.=<?>@>@ACBD245EA. FHGJI'KLNMPORQJSUT=VMDWJSXLZY[MD]_aVRQbMcVRSXSXLNMPVRQed=SXfgG4L[[IhS@ViXjk LNlIhfgMPVRQJnmbVopnLNSXSXXjqFHGJI'KLNMPORQJSFHrtsvuxwtyzjRT={|. }@bEEp4[bR;C? ;.

9 Aug 2005: " # $&%'( ),.-'/'0!1. 324'/5 # 6 6 78,:9. ,;< =0 > 78$?3@. ACB)DFECG>HJILKMB>N OQPRDTS4U:PRVMWXDIYPZD [&WXRG]CPT_KTVQGHbadcegfih:j)kmlon)p=qgr3s)lot=qLkmuvlxwzy;{|s)pJlos)qLqYkmlos)p;}qLZfikmwmhCqLs>w.