Results 81 to 90 of about 282,377 (316)
On the geometric interpretation of the nonnegative rank [PDF]
The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors needed to reconstruct it exactly. The problem of determining this rank and computing the corresponding nonnegative factors is difficult; however it has ...
GILLIS, Nicolas, GLINEUR, François
core
Metrics to Rank Illegal Buildings
, 2019 The problem of illegal buildings (IBs) is becoming dramatic in developing countries due to the population explosion, but, at the same time, it is still an unsolved issue also in several states usually called advanced (e.g., Italy).
Di Felice P., Paolino Di Felice
core +1 more source
Rank reduction for the local consistency problem [PDF]
, 2012 We address the problem of how simple a solution can be for a given quantum local consistency instance. More specifically, we investigate how small the rank of the global density operator can be if the local constraints are known to be compatible.
Ji Zhengfeng +24 more
core +1 more source
Relative Depth Estimation as a Ranking Problem
CoRR, 2020 Accepted at SIU ...
Alican Mertan +2 more
openaire +2 more sources
New Directions for Adult and Continuing Education, EarlyView.ABSTRACT This article examines the evolving role of organizational leadership amidst the rapid advancements in artificial intelligence (AI). It explores a broadly experienced and documented crisis in leadership, due in part to the disruptive nature of AI and emerging technology.
Rachel Wlodarsky, Davin Carr Chellman
wiley +1 more source
Structured low-rank approximation and its applications
, 2008 Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equivalent to the existence of a linear time-invariant system that fits the data ...
Markovsky, Ivan
core
Minimum rank of skew-symmetric matrices described by a graph
, 2010 The minimum (symmetric) rank of a simple graph G over a field F is the smallest possible rank among all symmetric matrices over F whose ijth entry (for i≠j) is nonzero whenever {i,j} is an edge in G and is zero otherwise.
IMA-ISU research group on minimum rank,
core +1 more source
TV Regularized Low-Rank Framework for Localizing Premature Ventricular Contraction Origin
IEEE Access, 2019 Premature ventricular contraction (PVC) can cause great harm to human health. Both invasive and non-invasive techniques for detecting electrical activity of PVC or locating ectopic pacemakers are used in clinical diagnosis.
Lin Fang +4 more
doaj +1 more source
Feature Ranking for Total Ordering Ranking Problems
Proceedings of the 2010 International Conference on E-Business Intelligence, 2010 In this paper, we first introduce the development of learning to rank and discuss the problems existing in this field especially the ignorance of total ordering ranking. For dealing with the total ordering ranking problem, we assume a method “feature ranking”. Based the assumption, we design two algorithms: Feature Rank and BL-FeatureRank.
Daniel Zeng, Yongqing Wang
openaire +2 more sources
Rank one tensor completion problem
CoRR, 2020 In this paper, we consider the rank-one tensor completion problem. We address the question of existence and uniqueness of the rank-one solution. In particular we show that the global uniqueness over the field of real numbers can be verified in a polynomial time.
Mohit Singh +2 more
openaire +2 more sources