Results 301 to 310 of about 872,020 (326)

A Generalized Hard Thresholding Pursuit Algorithm

Circuits, Systems, and Signal Processing, 2013
Compressed sensing ensures the accurate reconstruction of sparse signals from far fewer samples than required in the classical Shannon–Nyquist theorem. In this paper, a generalized hard thresholding pursuit (GHTP) algorithm is presented that can recover unknown vectors without the sparsity level information.
Haifeng Li 0004, Yuli Fu 0001, Qiheng Zhang, Rong Rong   +3 more
openaire   +1 more source

Hardness of Dynamic Core and Truss Decompositions

Workshop on Approximation and Online Algorithms
The k-core of a graph is its maximal subgraph with minimum degree at least k, and the core value of a vertex u is the largest k for which u is contained in the k-core of the graph.
Yan S. Couto, C. Fernandes
semanticscholar   +1 more source

ON THE GENERIC COMPLEXITY OF THE DISCRETE LOGARITHM PROBLEM IN LUCAS SEQUENCES

PRIKLADNAYa DISKRETNAYa MATEMATIKA
In this paper, we study the generic complexity of the discrete logarithm problem over Lucas sequences. This problem was exploited in the 1990s by the New Zealand cryptographer P.
A. N. Rybalov
semanticscholar   +1 more source

Review on the laboratory analysis and patient monitoring of generic and branded drug for type 2 diabetes melitus: a focus on efficacy, lipid profile and sugar level.

International journal of pharmaceutics and drug analysis
Context: Insulin resistance and poor glucose metabolism are hallmarks of Type-2 Diabetes Mellitus (T2DM), a chronic illness that calls for long-term pharmaceutical treatment.
Y. J., A. G, S. S, K. Rahul, S. R, S. R
semanticscholar   +1 more source

General H-Theorem for Hard Spheres

Journal of Statistical Physics, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bednorz, Adam, Cichocki, Bogdan
openaire   +2 more sources

On the generic complexity of the problem of computing the Euler function

PRIKLADNAYa DISKRETNAYa MATEMATIKA
We study the generic complexity of the problem of the Euler function computation. This problem has important applications in modern cryptography. For example, the cryptographic strength of the famous public key encryption system RSA is based on the ...
A. N. Rybalov
semanticscholar   +1 more source

On the Approximation Hardness of Some Generalizations of TSP

2006
The aim of this paper is to investigate the approximability of some generalized versions of TSP which typically arise in practical applications. The most important generalization is TSP with time windows, where some vertices have to be visited after some specified opening time, but before some deadline. Our main results are as follows (assuming P ≠NP)
Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke 0002   +3 more
openaire   +1 more source

Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?

arXiv.org
Answer Set Programming (ASP) is a generic problem modeling and solving framework with a strong focus on knowledge representation and a rapid growth of industrial applications.
Markus Hecher, Rafael Kiesel
semanticscholar   +1 more source

An Adversarial Approach to Hard Triplet Generation

2018
While deep neural networks have demonstrated competitive results for many visual recognition and image retrieval tasks, the major challenge lies in distinguishing similar images from different categories (i.e., hard negative examples) while clustering images with large variations from the same category (i.e., hard positive examples).
Yiru Zhao, Zhongming Jin 0001, Guo-Jun Qi, Hongtao Lu 0001, Xian-Sheng Hua 0001   +4 more
openaire   +2 more sources

Complexity Bounds on General Hard-Core Predicates

Journal of Cryptology, 2001
A Boolean function is said to be a hard-core predicate for a one-way function if it is efficiently computable, but given the value of the one-way function, the value of the hard-core predicate is difficult to predict. The question studied in the present paper is how hard a function must be in order to be a hard-core predicate.
Mikael Goldmann, Mats Näslund, Alexander Russell   +2 more
openaire   +1 more source