Pages that link to "Item:Q399498"
From MaRDI portal
The following pages link to Acta Universitatis Sapientiae. Informatica (Q399498):
Displayed 50 items.
- Improving productivity in large scale testing at the compiler level by changing the intermediate language from C++ to Java (Q2236365) (← links)
- A new model for the linear 1-dimensional online clustering problem (Q2254541) (← links)
- Induced label graphoidal graphs (Q2254542) (← links)
- Remarks on the \(\mathrm A^{\ast\ast}\) algorithm (Q2254543) (← links)
- Partitioning to three matchings of given size is NP-complete for bipartite graphs (Q2254544) (← links)
- Reconstruction of score sets (Q2254545) (← links)
- Statistical complexity and generalized number system (Q2254546) (← links)
- Recognition of split-graphic sequences (Q2254547) (← links)
- Finding sequential patterns with TF-IDF metrics in health-care databases (Q2254550) (← links)
- Estimating the maximum rise in temperature according to climate models using abstract interpretation (Q2283722) (← links)
- A study on the pendant number of graph products (Q2283724) (← links)
- Comparing two- and three-view computer vision (Q2283726) (← links)
- New results on connected dominating structures in graphs (Q2283728) (← links)
- Automatic detection of hard and soft exudates from retinal fundus images (Q2283731) (← links)
- Gesture-driven LEGO robots (Q2283733) (← links)
- \(J\)-coloring of graph operations (Q2283734) (← links)
- Estimating clique size by coloring the nodes of auxiliary graphs (Q2326165) (← links)
- Sampling \(k\)-partite graphs with a given degree sequence (Q2326166) (← links)
- Minimum covering reciprocal distance signless Laplacian energy of graphs (Q2326167) (← links)
- Statistical complexity of the quasiperiodical damped systems (Q2326168) (← links)
- On scores in tournaments (Q2326169) (← links)
- Modular strategic SMT solving with \textbf{SMT-RAT} (Q2414693) (← links)
- Hierarchical clustering with deep q-learning (Q2414694) (← links)
- A note on label propagation for semi-supervised learning (Q2516850) (← links)
- Minimization of the Perron eigenvalue of incomplete pairwise comparison matrices by Newton iteration (Q2516852) (← links)
- Tripartite graphs with given degree set (Q2516853) (← links)
- Empirical study of the greedy heuristic as applied to the link selection problem (Q2516854) (← links)
- Distance-constrained grid colouring (Q2629563) (← links)
- A survey of the all-pairs shortest paths problem and its variants in graphs (Q2629565) (← links)
- Edge coloring of graphs, uses, limitation, complexity (Q2629566) (← links)
- Improving the effectiveness of FMEA analysis in automotive -- a case study (Q2629568) (← links)
- On the nullity of a family of tripartite graphs (Q2629570) (← links)
- Signless Laplacian energy of a first KCD matrix (Q2674148) (← links)
- Limit laws for two distance-based indices in random recursive tree models (Q2674149) (← links)
- U-Net architecture variants for brain tumor segmentation of histogram corrected images (Q2674151) (← links)
- On graphs associated to ring of Guassian integers and ring of integers modulo \(n\) (Q2674152) (← links)
- Transmission-reciprocal transmission index and coindex of graphs (Q2674155) (← links)
- On Seidel Laplacian matrix and energy of graphs (Q2674156) (← links)
- Annihilator graphs of a commutative semigroup whose zero-divisor graphs are a complete graph with an end vertex (Q2674157) (← links)
- Some properties of the closed global shadow graphs and their zero forcing number (Q2674159) (← links)
- On domination in signed graphs (Q6050454) (← links)
- SapiPin: observations on PIN-code typing dynamics (Q6050455) (← links)
- Connected certified domination edge critical and stable graphs (Q6050458) (← links)
- On the spread of the distance signless Laplacian matrix of a graph (Q6050460) (← links)
- Some relations between energy and Seidel energy of a graph (Q6050461) (← links)
- Explainable patch-level histopathology tissue type detection with bag-of-local-features models and data augmentation (Q6050463) (← links)
- E-super arithmetic graceful labelling of \(H_i(m, m)\), \(H_i^{(1)}(m, m)\) and chain of even cycles (Q6050464) (← links)
- Textual outlier detection with an unsupervised method using text similarity and density peak (Q6050468) (← links)
- Eccentric connectivity index in transformation graph \(G^{xy+}\) (Q6050469) (← links)
- On agglomeration-based rupture degree in networks and a heuristic algorithm (Q6050471) (← links)