نتایج جستجو برای: inclusion measure

تعداد نتایج: 466442  

2003
Gustavo K. Rohde Sinisa Pajevic Carlo Pierpaoli Peter J. Basser

We describe a general framework for multi-channel image registration. A new similarity measure for registering two multi-channel images, each with an arbitrary number of channels, is proposed. Results show that image registration performed based on different channels generates different results. In addition, we show that, when available, the inclusion of multi-channel data in the registration p...

2007
Kerim Yunt Christoph Glocker

A measure differential inclusion (MDI) based modeling approach for rigidbody mechanical systems will be introduced, that can exhibit autonomous or controlled mode transitions, accompanied by discontinuities on velocity and acceleration level. The hybrid optimal control necessitates the consideration of an uncommon concept of control, namely, controls of unbounded, impulsive and set-valued type....

Journal: :Evidence-based mental health 2004
Harriet L MacMillan C Nadine Wathen

Study selection and analysis: Inclusion criteria: experimental or quasi-experimental studies with a comparison group (randomised control groups or treatment dropouts); victim reports or police records (criminal reports) used to measure recidivism. Effect sizes using Cohen’s d were calculated. A hierarchical fixed effects model was used to assess the impacts of report type, study design, and tre...

Journal: :Evidence-based mental health 2003
Philip Hazell

Study selection Clinical studies presenting a quantifiable measure of the association between therapeutic relationship variables and treatment outcomes in children or adolescents were eligible. Studies had to include at least 5 participants, and be presented in English. Treatments meeting inclusion criteria were parent management training, individual therapy and family therapy. Studies examinin...

Journal: :Proceedings of the American Mathematical Society 1977

Journal: :Chemical & Engineering News Archive 1997

Journal: :Transactions of the American Mathematical Society 1978

2006
Lukasz Kowalik

We show an O(1.344) = O(2) algorithm for edge-coloring an n-vertex graph using three colors. Our algorithm uses polynomial space. This improves over the previous, O(2) algorithm of Beigel and Eppstein [1]. We apply a very natural approach of generating inclusion-maximal matchings of the graph. The time complexity of our algorithm is estimated using the “measure and con-

2012
Ted Pedersen

This paper describes the Duluth systems that participated in Task 2 of SemEval–2012. These systems were unsupervised and relied on variations of the Gloss Vector measure found in the freely available software package WordNet::Similarity. This method was moderately successful for the Class-Inclusion, Similar, Contrast, and Non-Attribute categories of semantic relations, but mimicked a random bas...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید