scispace - formally typeset
Search or ask a question
Institution

Huawei

CompanyShenzhen, China
About: Huawei is a company organization based out in Shenzhen, China. It is known for research contribution in the topics: Terminal (electronics) & Signal. The organization has 41417 authors who have published 44698 publications receiving 343496 citations. The organization is also known as: Huawei Technologies & Huawei Technologies Co., Ltd..


Papers
More filters
Patent
Xu Li1, Sophie Vrzic1, Jaya Rao1
20 Jan 2016
TL;DR: In this article, a method for software defined topology (SDT) management interworking with network function virtualization (NFV) and software defined networking (SDN) is presented.
Abstract: System and method embodiments are provided for enabling software defined topology (SDT) to interwork with network function virtualization (NFV) and software defined networking (SDN). In an embodiment, a method for software defined topology (SDT) management interworking with network function virtualization (NFV) and software defined networking (SDN) includes receiving, at an SDT Manager, from a service customer, a service request comprising a virtual service function forwarding graph (VSF FG); selecting a virtual network function (VNF) forwarding graph (FG) template in accordance with the received service request; generating a virtual function (VF) FG in accordance with the service request and the selected VNF FG template; selecting a point of presence (PoPs) for a VF in the VF FG; and transmitting, to an NFV Manager, instructions to instantiate the VF in accordance with at least one of the generated VF FG and the determined PoP.

81 citations

Posted Content
TL;DR: This work proposes a two-stage algorithm called Automatic Feature Interaction Selection (AutoFIS), which can automatically identify important feature interactions for factorization models with computational cost just equivalent to training the target model to convergence.
Abstract: Learning feature interactions is crucial for click-through rate (CTR) prediction in recommender systems. In most existing deep learning models, feature interactions are either manually designed or simply enumerated. However, enumerating all feature interactions brings large memory and computation cost. Even worse, useless interactions may introduce noise and complicate the training process. In this work, we propose a two-stage algorithm called Automatic Feature Interaction Selection (AutoFIS). AutoFIS can automatically identify important feature interactions for factorization models with computational cost just equivalent to training the target model to convergence. In the \emph{search stage}, instead of searching over a discrete set of candidate feature interactions, we relax the choices to be continuous by introducing the architecture parameters. By implementing a regularized optimizer over the architecture parameters, the model can automatically identify and remove the redundant feature interactions during the training process of the model. In the \emph{re-train stage}, we keep the architecture parameters serving as an attention unit to further boost the performance. Offline experiments on three large-scale datasets (two public benchmarks, one private) demonstrate that AutoFIS can significantly improve various FM based models. AutoFIS has been deployed onto the training platform of Huawei App Store recommendation service, where a 10-day online A/B test demonstrated that AutoFIS improved the DeepFM model by 20.3\% and 20.1\% in terms of CTR and CVR respectively.

81 citations

Patent
Jing Yao1, Dong Zhao1
06 Mar 2007
TL;DR: In this paper, a charging method, a system and a server for the POC service are described, and a charging scheme based on the number of the clients participated in the conversation to the user is presented.
Abstract: A charging method, a system and a server for Poc service are disclosed. The Poc server transmits updating CCR message to OCS when the number of the clients participated in conversation changes, the message carries the information of the number of the clients participated in the conversation. The present invention could provide the charging scheme based on the number of the clients participated in the conversation to the user, therefore the diversiform charging requirements of operators are fulfilled and the satisfaction degree of users is increased.

81 citations

Posted Content
Minghao Xu1, Hang Wang1, Bingbing Ni1, Qi Tian2, Wenjun Zhang1 
TL;DR: GPA as discussed by the authors proposes a graph-induced prototype alignment (GPA) framework to seek for category-level domain alignment via elaborate prototype representations, where more precise instance-level features are obtained through graph-based information propagation among region proposals, and, on such basis, the prototype representation of each class is derived for category level domain alignment.
Abstract: Applying the knowledge of an object detector trained on a specific domain directly onto a new domain is risky, as the gap between two domains can severely degrade model's performance. Furthermore, since different instances commonly embody distinct modal information in object detection scenario, the feature alignment of source and target domain is hard to be realized. To mitigate these problems, we propose a Graph-induced Prototype Alignment (GPA) framework to seek for category-level domain alignment via elaborate prototype representations. In the nutshell, more precise instance-level features are obtained through graph-based information propagation among region proposals, and, on such basis, the prototype representation of each class is derived for category-level domain alignment. In addition, in order to alleviate the negative effect of class-imbalance on domain adaptation, we design a Class-reweighted Contrastive Loss to harmonize the adaptation training process. Combining with Faster R-CNN, the proposed framework conducts feature alignment in a two-stage manner. Comprehensive results on various cross-domain detection tasks demonstrate that our approach outperforms existing methods with a remarkable margin. Our code is available at this https URL.

81 citations

Posted Content
TL;DR: In this paper, a content centric network architecture which uses software defined networking principles to implement efficient metadata driven services by extracting content metadata at the network layer is described. But the ability to access content metadata transparently enables a number of new services in the network.
Abstract: This paper describes a content centric network architecture which uses software defined networking principles to implement efficient metadata driven services by extracting content metadata at the network layer. The ability to access content metadata transparently enables a number of new services in the network. Specific examples discussed here include: a metadata driven traffic engineering scheme which uses prior knowledge of content length to optimize content delivery, a metadata driven content firewall which is more resilient than traditional firewalls and differentiated treatment of content based on the type of content being accessed. A detailed outline of an implementation of the proposed architecture is presented along with some basic evaluation.

81 citations


Authors

Showing all 41483 results

NameH-indexPapersCitations
Yu Huang136149289209
Xiaoou Tang13255394555
Xiaogang Wang12845273740
Shaobin Wang12687252463
Qiang Yang112111771540
Wei Lu111197361911
Xuemin Shen106122144959
Li Chen105173255996
Lajos Hanzo101204054380
Luca Benini101145347862
Lei Liu98204151163
Tao Wang97272055280
Mohamed-Slim Alouini96178862290
Qi Tian96103041010
Merouane Debbah9665241140
Network Information
Related Institutions (5)
Alcatel-Lucent
53.3K papers, 1.4M citations

90% related

Bell Labs
59.8K papers, 3.1M citations

88% related

Hewlett-Packard
59.8K papers, 1.4M citations

87% related

Microsoft
86.9K papers, 4.1M citations

87% related

Intel
68.8K papers, 1.6M citations

87% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202319
202266
20212,069
20203,277
20194,570
20184,476