Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,114,373 papers from all fields of science
Search
Sign In
Create Free Account
Weight function
Known as:
Weighting Function
, Density Weighting Function
, Weight (disambiguation)
Expand
A weight function is a mathematical device used when performing a sum, integral, or average to give some elements more "weight" or influence on the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
18 relations
Assignment problem
Astrophysics Data System
Bounded variation
Discrete mathematics
Expand
Broader (1)
Combinatorial optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
A Classifier of Malicious Android Applications
G. Canfora
,
F. Mercaldo
,
C. A. Visaggio
ARES
2013
Corpus ID: 5957232
Malware for smart phones is rapidly spreading out. This paper proposes a method for detecting malware based on three metrics…
Expand
Highly Cited
2011
Highly Cited
2011
Joint Optimal Cooperative Sensing and Resource Allocation in Multichannel Cognitive Radio Networks
Rongfei Fan
,
Hai Jiang
,
Q. Guo
,
Zhou Zhang
IEEE Transactions on Vehicular Technology
2011
Corpus ID: 1684595
In this paper, the problem of joint multichannel cooperative sensing and resource allocation is investigated. A cognitive radio…
Expand
Highly Cited
2010
Highly Cited
2010
Coordinated linear beamforming in downlink multi-cell wireless networks
L. Venturino
,
N. Prasad
,
Xiaodong Wang
Asilomar Conference on Signals, Systems and…
2010
Corpus ID: 206823757
We consider the problem of co-channel interference mitigation in a downlink multi-cell wireless network. Assuming that each…
Expand
Highly Cited
2008
Highly Cited
2008
A genetic-algorithm-based optimization model for scheduling flexible assembly lines
Z. X. Guo
,
W. K. Wong
,
S. Leung
,
Jintu Fan
,
S. Chan
2008
Corpus ID: 62749205
In this paper, a scheduling problem in the flexible assembly line (FAL) is investigated. The mathematical model for this problem…
Expand
Highly Cited
2006
Highly Cited
2006
Oscillator and Filter Algorithms for Virtual Analog Synthesis
V. Välimäki
,
Antti Huovilainen
Computer Music Journal
2006
Corpus ID: 207618021
19 Virtual analog synthesis refers to computational methods that imitate the sound production principles used in electronic music…
Expand
Highly Cited
1999
Highly Cited
1999
A Function Point-Like Measure for Object-Oriented Software
G. Antoniol
,
C. Lokan
,
G. Caldiera
,
R. Fiutem
Empirical Software Engineering
1999
Corpus ID: 6911739
We present a method for estimating the size, and consequently effort and duration, of object oriented software development…
Expand
Highly Cited
1996
Highly Cited
1996
Evaluation of emissivity correlations for H2OCO2N2/air mixtures and coupling with solution methods of the radiative transfer equation
N. Lallemant
,
A. Sayre
,
R. Weber
1996
Corpus ID: 18070409
Highly Cited
1996
Highly Cited
1996
Biological Weighting Functions for Describing the Effects of Ultraviolet Radiation on Aquatic Systems
J. Cullen
,
Nova Scotia
,
P. Neale
1996
Corpus ID: 29172909
Highly Cited
1983
Highly Cited
1983
A parallel scan conversion algorithm with anti-aliasing for a general-purpose ultracomputer
E. Fiume
,
A. Fournier
,
L. Rudolph
International Conference on Computer Graphics and…
1983
Corpus ID: 14310429
Popular approaches to speeding up scan conversion often employ parallel processing. Recently, several special-purpose parallel…
Expand
Highly Cited
1978
Highly Cited
1978
Design of absolutely optimal quantizers for a wide class of distortion measures
D. Sharma
IEEE Transactions on Information Theory
1978
Corpus ID: 1818632
In this paper designs of two types of quantizers are presented. The first type is designed to minimize a distortion measure under…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE