نتایج جستجو برای: label graphoidalcovering number

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

Journal: :Radiation oncology 2016
Joris Van de Velde Johan Wouters Tom Vercauteren Werner De Gersem Eric Achten Wilfried De Neve Tom Van Hoof

BACKGROUND The present study aimed to define the optimal number of atlases for automatic multi-atlas-based brachial plexus (BP) segmentation and to compare Simultaneous Truth and Performance Level Estimation (STAPLE) label fusion with Patch label fusion using the ADMIRE® software. The accuracy of the autosegmentations was measured by comparing all of the generated autosegmentations with the ana...

Journal: :Molecular & cellular proteomics : MCP 2016
Harsha P Gunawardena Jonathon O'Brien John A Wrobel Ling Xie Sherri R Davies Shunqiang Li Matthew J Ellis Bahjat F Qaqish Xian Chen

Single quantitative platforms such as label-based or label-free quantitation (LFQ) present compromises in accuracy, precision, protein sequence coverage, and speed of quantifiable proteomic measurements. To maximize the quantitative precision and the number of quantifiable proteins or the quantifiable coverage of tissue proteomes, we have developed a unified approach, termed QuantFusion, that c...

Journal: :Journal of Machine Learning Research 2017
Deepayan Chakrabarti Stanislav Funiak Jonathan Chang Sofus A. Macskassy

We consider the problem of inferring node labels in a partially labeled graph where each node in the graph has multiple label types and each label type has a large number of possible labels. Our primary example, and the focus of this paper, is the joint inference of label types such as hometown, current city, and employers for people connected by a social network; by predicting these user profi...

2014
Deepayan Chakrabarti Stanislav Funiak Jonathan Chang Sofus A. Macskassy

We tackle the problem of inferring node labels in a partially labeled graph where each node in the graph has multiple label types and each label type has a large number of possible labels. Our primary example, and the focus of this paper, is the joint inference of label types such as hometown, current city, and employers, for users connected by a social network. Standard label propagation fails...

Journal: :CoRR 2017
Yue Zhu James T. Kwok Zhi-Hua Zhou

It is well-known that exploiting label correlations is important to multi-label learning. Existing approaches either assume that the label correlations are global and shared by all instances; or that the label correlations are local and shared only by a data subset. In fact, in the real-world applications, both cases may occur that some label correlations are globally applicable and some are sh...

2012
Sheng-Jun Huang Zhi-Hua Zhou

It is well known that exploiting label correlations is important for multi-label learning. Existing approaches typically exploit label correlations globally, by assuming that the label correlations are shared by all the instances. In real-world tasks, however, different instances may share different label correlations, and few correlations are globally applicable. In this paper, we propose the ...

2014
Melanie Khu Susan A. Graham Patricia A. Ganea

The present study investigated whether naming would facilitate infants' transfer of information from picture books to the real world. Eighteen- and 21-month-olds learned a novel label for a novel object depicted in a picture book. Infants then saw a second picture book in which an adult demonstrated how to elicit the object's non-obvious property. Accompanying narration described the pictures u...

2010
Yu-Yin Sun Yin Zhang Zhi-Hua Zhou

Multi-label learning deals with data associated with multiple labels simultaneously. Previous work on multi-label learning assumes that for each instance, the “full” label set associated with each training instance is given by users. In many applications, however, to get the full label set for each instance is difficult and only a “partial” set of labels is available. In such cases, the appeara...

Journal: :J. Graph Algorithms Appl. 2012
Bojan Mohar Petr Skoda

We study the minimum number of label transitions around a given vertex v0 in a planar multigraph G, in which the edges incident with v0 are labelled with integers 1, . . . , l, and the minimum is taken over all embeddings of G in the plane. For a fixed number of labels, a lineartime fixed-parameter tractable algorithm that computes the minimum number of label transitions around v0 is presented....

2005
Huaqun Guo Lek Heng Ngoh Lawrence Wai-Choong Wong

This paper proposes DINloop (Data-In-Network loop) based multicast with GMPLS (generalized multiprotocol label switching) to overcome the scalability problems existing in current inter-domain multicast protocols. In our approach, multiple multicast sessions share a single DINloop instead of constructing individual multicast trees. DINloop is a special path formed using GMPLS to establish LSPs (...

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

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