Datasets:

yxchar

/

sciie-tlm

like 0

[[ Honorifics ]] are used extensively in << Japanese >> , reflecting the social relationship -LRB- e.g. social ranks and age -RRB- of the referents .

This [[ referential information ]] is vital for resolving << zero pronouns >> and improving machine translation outputs .

This [[ referential information ]] is vital for resolving zero pronouns and improving << machine translation outputs >> .

<< Visually-guided arm reaching movements >> are produced by [[ distributed neural networks ]] within parietal and frontal regions of the cerebral cortex .

Experimental data indicate that -LRB- I -RRB- single neurons in these regions are broadly tuned to parameters of movement ; -LRB- 2 -RRB- appropriate commands are elaborated by populations of neurons ; -LRB- 3 -RRB- the << coordinated action of neu-rons >> can be visualized using a [[ neuronal population vector -LRB- NPV -RRB- ]] .

We designed a [[ model ]] of the << cortical motor command >> to investigate the relation between the desired direction of the movement , the actual direction of movement and the direction of the NPV in motor cortex .

We designed a model of the cortical motor command to investigate the relation between the desired direction of the movement , the actual direction of movement and the direction of the [[ NPV ]] in << motor cortex >> .

The model is a [[ two-layer self-organizing neural network ]] which combines broadly-tuned -LRB- muscular -RRB- proprioceptive and -LRB- cartesian -RRB- visual information to calculate << -LRB- angular -RRB- motor commands >> for the initial part of the movement of a two-link arm .

The model is a << two-layer self-organizing neural network >> which combines [[ broadly-tuned -LRB- muscular -RRB- proprioceptive ]] and -LRB- cartesian -RRB- visual information to calculate -LRB- angular -RRB- motor commands for the initial part of the movement of a two-link arm .

The model is a two-layer self-organizing neural network which combines [[ broadly-tuned -LRB- muscular -RRB- proprioceptive ]] and << -LRB- cartesian -RRB- visual information >> to calculate -LRB- angular -RRB- motor commands for the initial part of the movement of a two-link arm .

The model is a << two-layer self-organizing neural network >> which combines broadly-tuned -LRB- muscular -RRB- proprioceptive and [[ -LRB- cartesian -RRB- visual information ]] to calculate -LRB- angular -RRB- motor commands for the initial part of the movement of a two-link arm .

These results suggest the NPV does not give a faithful << image of cortical processing >> during [[ arm reaching movements ]] .

It is well-known that diversity among [[ base classifiers ]] is crucial for constructing a strong << ensemble >> .

In this paper , we propose an alternative way for << ensemble construction >> by [[ resampling pairwise constraints ]] that specify whether a pair of instances belongs to the same class or not .

Using [[ pairwise constraints ]] for << ensemble construction >> is challenging because it remains unknown how to influence the base classifiers with the sampled pairwise constraints .

First , we transform the original instances into a new << data representation >> using [[ projections ]] learnt from pairwise constraints .

First , we transform the original instances into a new data representation using << projections >> learnt from [[ pairwise constraints ]] .

Then , we build the << base clas-sifiers >> with the new [[ data representation ]] .

We propose two methods for << resampling pairwise constraints >> following the standard [[ Bagging and Boosting algorithms ]] , respectively .

A new [[ algorithm ]] for solving the three << dimensional container packing problem >> is proposed in this paper .

This new [[ algorithm ]] deviates from the traditional << approach of wall building and layering >> .

We tested our << method >> using all 760 test cases from the [[ OR-Library ]] .

Experimental results indicate that the new << algorithm >> is able to achieve an [[ average packing utilization ]] of more than 87 % .

Current [[ approaches ]] to << object category recognition >> require datasets of training images to be manually prepared , with varying degrees of supervision .

Current << approaches >> to object category recognition require [[ datasets ]] of training images to be manually prepared , with varying degrees of supervision .

We present an [[ approach ]] that can learn an << object category >> from just its name , by utilizing the raw output of image search engines available on the Internet .

We develop a new model , << TSI-pLSA >> , which extends [[ pLSA ]] -LRB- as applied to visual words -RRB- to include spatial information in a translation and scale invariant manner .

We develop a new model , TSI-pLSA , which extends [[ pLSA ]] -LRB- as applied to << visual words >> -RRB- to include spatial information in a translation and scale invariant manner .

We develop a new model , << TSI-pLSA >> , which extends pLSA -LRB- as applied to visual words -RRB- to include [[ spatial information ]] in a translation and scale invariant manner .

Our [[ approach ]] can handle the high << intra-class variability >> and large proportion of unrelated images returned by search engines .

Our [[ approach ]] can handle the high intra-class variability and large proportion of << unrelated images >> returned by search engines .

Our approach can handle the high [[ intra-class variability ]] and large proportion of << unrelated images >> returned by search engines .

Our approach can handle the high intra-class variability and large proportion of << unrelated images >> returned by [[ search engines ]] .

We evaluate the << models >> on standard [[ test sets ]] , showing performance competitive with existing methods trained on hand prepared datasets .

We evaluate the models on standard [[ test sets ]] , showing performance competitive with existing << methods >> trained on hand prepared datasets .

We evaluate the << models >> on standard test sets , showing performance competitive with existing [[ methods ]] trained on hand prepared datasets .

We evaluate the models on standard test sets , showing performance competitive with existing << methods >> trained on [[ hand prepared datasets ]] .

The paper provides an overview of the research conducted at LIMSI in the field of [[ speech processing ]] , but also in the related areas of << Human-Machine Communication >> , including Natural Language Processing , Non Verbal and Multimodal Communication .

The paper provides an overview of the research conducted at LIMSI in the field of speech processing , but also in the related areas of << Human-Machine Communication >> , including [[ Natural Language Processing ]] , Non Verbal and Multimodal Communication .

The paper provides an overview of the research conducted at LIMSI in the field of speech processing , but also in the related areas of Human-Machine Communication , including [[ Natural Language Processing ]] , << Non Verbal and Multimodal Communication >> .

The paper provides an overview of the research conducted at LIMSI in the field of speech processing , but also in the related areas of << Human-Machine Communication >> , including Natural Language Processing , [[ Non Verbal and Multimodal Communication ]] .

We have calculated << analytical expressions >> for how the bias and variance of the estimators provided by various temporal difference value estimation algorithms change with offline updates over trials in absorbing Markov chains using [[ lookup table representations ]] .

In this paper , we describe the [[ pronominal anaphora resolution module ]] of << Lucy >> , a portable English understanding system .

In this paper , we describe the pronominal anaphora resolution module of [[ Lucy ]] , a portable << English understanding system >> .

In this paper , we reported experiments of << unsupervised automatic acquisition of Italian and English verb subcategorization frames -LRB- SCFs -RRB- >> from [[ general and domain corpora ]] .

The proposed << technique >> operates on [[ syntactically shallow-parsed corpora ]] on the basis of a limited number of search heuristics not relying on any previous lexico-syntactic knowledge about SCFs .

The proposed << technique >> operates on syntactically shallow-parsed corpora on the basis of a limited number of [[ search heuristics ]] not relying on any previous lexico-syntactic knowledge about SCFs .

The proposed technique operates on syntactically shallow-parsed corpora on the basis of a limited number of search heuristics not relying on any previous << lexico-syntactic knowledge >> about [[ SCFs ]] .

[[ Graph-cuts optimization ]] is prevalent in << vision and graphics problems >> .

It is thus of great practical importance to parallelize the << graph-cuts optimization >> using to-day 's ubiquitous [[ multi-core machines ]] .

However , the current best << serial algorithm >> by Boykov and Kolmogorov -LSB- 4 -RSB- -LRB- called the [[ BK algorithm ]] -RRB- still has the superior empirical performance .

In this paper , we propose a novel [[ adaptive bottom-up approach ]] to parallelize the << BK algorithm >> .

Extensive experiments in common [[ applications ]] such as 2D/3D image segmentations and 3D surface fitting demonstrate the effectiveness of our << approach >> .

Extensive experiments in common << applications >> such as [[ 2D/3D image segmentations ]] and 3D surface fitting demonstrate the effectiveness of our approach .

Extensive experiments in common applications such as [[ 2D/3D image segmentations ]] and << 3D surface fitting >> demonstrate the effectiveness of our approach .

Extensive experiments in common << applications >> such as 2D/3D image segmentations and [[ 3D surface fitting ]] demonstrate the effectiveness of our approach .

We study the question of how to make loss-aware predictions in image segmentation settings where the << evaluation function >> is the [[ Intersection-over-Union -LRB- IoU -RRB- measure ]] that is used widely in evaluating image segmentation systems .

We study the question of how to make loss-aware predictions in image segmentation settings where the evaluation function is the [[ Intersection-over-Union -LRB- IoU -RRB- measure ]] that is used widely in evaluating << image segmentation systems >> .

Currently , there are two << dominant approaches >> : the [[ first ]] approximates the Expected-IoU -LRB- EIoU -RRB- score as Expected-Intersection-over-Expected-Union -LRB- EIoEU -RRB- ; and the second approach is to compute exact EIoU but only over a small set of high-quality candidate solutions .

Currently , there are two << dominant approaches >> : the first approximates the Expected-IoU -LRB- EIoU -RRB- score as Expected-Intersection-over-Expected-Union -LRB- EIoEU -RRB- ; and the [[ second approach ]] is to compute exact EIoU but only over a small set of high-quality candidate solutions .

Our new << methods >> use the [[ EIoEU approximation ]] paired with high quality candidate solutions .

Experimentally we show that our new << approaches >> lead to improved performance on both [[ image segmentation tasks ]] .

Later , however , Breiman cast serious doubt on this explanation by introducing a << boosting algorithm >> , [[ arc-gv ]] , that can generate a higher margins distribution than AdaBoost and yet performs worse .

Later , however , Breiman cast serious doubt on this explanation by introducing a boosting algorithm , [[ arc-gv ]] , that can generate a higher << margins distribution >> than AdaBoost and yet performs worse .

Later , however , Breiman cast serious doubt on this explanation by introducing a boosting algorithm , [[ arc-gv ]] , that can generate a higher margins distribution than << AdaBoost >> and yet performs worse .

Although we can reproduce his main finding , we find that the poorer performance of arc-gv can be explained by the increased [[ complexity ]] of the << base classifiers >> it uses , an explanation supported by our experiments and entirely consistent with the margins theory .

Although we can reproduce his main finding , we find that the poorer performance of << arc-gv >> can be explained by the increased complexity of the [[ base classifiers ]] it uses , an explanation supported by our experiments and entirely consistent with the margins theory .

The [[ transfer phase ]] in << machine translation -LRB- MT -RRB- systems >> has been considered to be more complicated than analysis and generation , since it is inherently a conglomeration of individual lexical rules .

The [[ transfer phase ]] in machine translation -LRB- MT -RRB- systems has been considered to be more complicated than << analysis >> and generation , since it is inherently a conglomeration of individual lexical rules .

The [[ transfer phase ]] in machine translation -LRB- MT -RRB- systems has been considered to be more complicated than analysis and << generation >> , since it is inherently a conglomeration of individual lexical rules .

The transfer phase in machine translation -LRB- MT -RRB- systems has been considered to be more complicated than [[ analysis ]] and << generation >> , since it is inherently a conglomeration of individual lexical rules .

Currently some attempts are being made to use [[ case-based reasoning ]] in << machine translation >> , that is , to make decisions on the basis of translation examples at appropriate pints in MT .

This paper proposes a new type of << transfer system >> , called a [[ Similarity-driven Transfer System -LRB- SimTran -RRB- ]] , for use in such case-based MT -LRB- CBMT -RRB- .

This paper proposes a new type of transfer system , called a [[ Similarity-driven Transfer System -LRB- SimTran -RRB- ]] , for use in such << case-based MT -LRB- CBMT -RRB- >> .

This paper addresses the problem of [[ optimal alignment of non-rigid surfaces ]] from multi-view video observations to obtain a << temporally consistent representation >> .

This paper addresses the problem of << optimal alignment of non-rigid surfaces >> from [[ multi-view video observations ]] to obtain a temporally consistent representation .

Conventional << non-rigid surface tracking >> performs [[ frame-to-frame alignment ]] which is subject to the accumulation of errors resulting in a drift over time .

Recently , << non-sequential tracking approaches >> have been introduced which reorder the input data based on a [[ dissimilarity measure ]] .

They demonstrate a reduced drift and increased [[ robustness ]] to large << non-rigid deformations >> .

[[ Optimisation of the tree ]] for << non-sequential tracking >> , which minimises the errors in temporal consistency due to both the drift and the jumps , is proposed .

<< Optimisation of the tree >> for non-sequential tracking , which minimises the errors in [[ temporal consistency ]] due to both the drift and the jumps , is proposed .

A novel [[ cluster tree ]] enforces << sequential tracking in local segments >> of the sequence while allowing global non-sequential traversal among these segments .

A novel [[ cluster tree ]] enforces sequential tracking in local segments of the sequence while allowing << global non-sequential traversal >> among these segments .

Comprehensive evaluation is performed on a variety of challenging << non-rigid surfaces >> including [[ face ]] , cloth and people .

Comprehensive evaluation is performed on a variety of challenging non-rigid surfaces including [[ face ]] , << cloth >> and people .

Comprehensive evaluation is performed on a variety of challenging << non-rigid surfaces >> including face , [[ cloth ]] and people .

Comprehensive evaluation is performed on a variety of challenging non-rigid surfaces including face , [[ cloth ]] and << people >> .

Comprehensive evaluation is performed on a variety of challenging << non-rigid surfaces >> including face , cloth and [[ people ]] .

It demonstrates that the proposed [[ cluster tree ]] achieves better temporal consistency than the previous << sequential and non-sequential tracking approaches >> .

It demonstrates that the proposed << cluster tree >> achieves better [[ temporal consistency ]] than the previous sequential and non-sequential tracking approaches .

Quantitative analysis on a created [[ synthetic facial performance ]] also shows an improvement by the << cluster tree >> .

The << translation of English text into American Sign Language -LRB- ASL -RRB- animation >> tests the limits of traditional [[ MT architectural designs ]] .

A new [[ semantic representation ]] is proposed that uses virtual reality 3D scene modeling software to produce << spatially complex ASL phenomena >> called '' classifier predicates . ''

A new << semantic representation >> is proposed that uses [[ virtual reality 3D scene modeling software ]] to produce spatially complex ASL phenomena called '' classifier predicates . ''

A new semantic representation is proposed that uses virtual reality 3D scene modeling software to produce << spatially complex ASL phenomena >> called '' [[ classifier predicates ]] . ''

The model acts as an interlingua within a new multi-pathway MT architecture design that also incorporates [[ transfer ]] and << direct approaches >> into a single system .

The model acts as an interlingua within a new multi-pathway MT architecture design that also incorporates [[ transfer ]] and direct approaches into a single << system >> .

The model acts as an interlingua within a new multi-pathway MT architecture design that also incorporates transfer and [[ direct approaches ]] into a single << system >> .

An << extension >> to the [[ GPSG grammatical formalism ]] is proposed , allowing non-terminals to consist of finite sequences of category labels , and allowing schematic variables to range over such sequences .

The [[ extension ]] is shown to be sufficient to provide a strongly adequate << grammar >> for crossed serial dependencies , as found in e.g. Dutch subordinate clauses .