Results 171 to 180 of about 26,354 (218)
Some of the next articles are maybe not open access.
Quantitative function for community detection
Physical Review E, 2008We propose a quantitative function for community partition -- i.e., modularity density or D value. We demonstrate that this quantitative function is superior to the widely used modularity Q and also prove its equivalence with the objective function of the kernel k means.
Zhenping, Li +4 more
openaire +2 more sources
A Functional Approach to Scanner Detection
Proceedings of the Asian Internet Engineering Conference, 2017Detecting scanning in Internet traffic is a well-studied topic with no single, definitive approach. Among the proposed methods are two which are widely accepted, but with known limitations: one based on a static fanout ratio, and another on principal component analysis (PCA).
Robert McAndrew +4 more
openaire +2 more sources
Detection of a Sparse Variable Function
Journal of Mathematical Sciences, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ingster, Yu. I., Suslina, I. A.
openaire +2 more sources
On the detection of singularities of a periodic function
Advances in Computational Mathematics, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hrushikesh Narhar Mhaskar +1 more
openaire +2 more sources
Discussion of “multivariate functional outlier detection”
Statistical Methods & Applications, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Naveen Naidu Narisetty, Xuming He 0002
openaire +3 more sources
Extrema detection of bivariate spline functions
Applied Mathematics and Computation, 2007The problem of finding the extrema of a two-variable spline function \(x(s,t)\) of degree \(k\geq 3\), in a rectangle \(\mathcal{D}\subset \mathbb{R}^2\), is examined. In this respect, a method is developed which allows to detect the extrema of \(x(s,t)\) as well as of their derivatives.
Hiroyuki Kano +2 more
openaire +1 more source
Detecting Boolean Functions for Proving Unsatisfiability
2009 21st IEEE International Conference on Tools with Artificial Intelligence, 2009In 1997, B. Selman and H. Kautz proposed a series of 10 challenges. One of them concerned the design of a practical stochastic local search procedure for proving unsatisfiability (Challenge 5). Today, more than 10 years later, only few attempts were led to address this challenge, in spite of the great number of incomplete methods for proving ...
Ostrowski, Richard, Paris, Lionel
openaire +2 more sources
3GPP traffic detection functionality
2012 IEEE International Conference on Communications (ICC), 2012Mobile operators may have policies related to specific applications, however up until 3GPP Release 11 they have been unable to detect and enforce at the application level without explicit service level signaling in place. The user experience as well as network resources usage is enhanced dramatically if the network becomes application aware and is able
openaire +1 more source
Comments on: Multivariate functional outlier detection
Statistical Methods & Applications, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luis Angel García-Escudero +2 more
openaire +1 more source
On the psychometric function for contrast detection
Vision Research, 1981Abstract The frequent current use in probability summation calculations of equations of the form. P = 1 − (1−γ)exp[−(I/α)β] to represent the psychometric function for contrast detection is based on two assumptions: (1) γ can be changed without affecting α and β (the high-threshold assumption) and (2) β is the same for all pattern-detecting ...
openaire +2 more sources