Results 61 to 70 of about 714,042 (275)
A Graph Optimization-Based Indoor Map Construction Method via Crowdsourcing
IEEE Access, 2018 Indoor mapping is an essential element of indoor navigation systems. In this paper, we present a graph optimization-based method for indoor map construction, which can be used in buildings without prior knowledge.
Baoding Zhou +7 more
doaj +1 more source
An Improved Pedestrian Ttracking Method Based on Wi-Fi Fingerprinting and Pedestrian Dead Reckoning
Sensors, 2020 Wi-Fi based positioning has great potential for use in indoor environments because Wi-Fi signals are near-ubiquitous in many indoor environments. With a Reference Fingerprint Map (RFM), fingerprint matching can be adopted for positioning.
Bo Feng +3 more
doaj +1 more source
DSL: Discriminative Subgraph Learning via Sparse Self-Representation
, 2019 The goal in network state prediction (NSP) is to classify the global state (label) associated with features embedded in a graph. This graph structure encoding feature relationships is the key distinctive aspect of NSP compared to classical supervised ...
Bogdanov, Petko, Zhang, Lin
core +1 more source
Molecular Oncology, EarlyView.Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson +9 more
wiley +1 more source
Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization [PDF]
, 2018 We suggest a general oracle-based framework that captures different parallel stochastic optimization settings described by a dependency graph, and derive generic lower bounds in terms of this graph.
McMahan, Brendan +4 more
core
Quadratically-Regularized Optimal Transport on Graphs
, 2018 Optimal transportation provides a means of lifting distances between points on a geometric domain to distances between signals over the domain, expressed as probability distributions. On a graph, transportation problems can be used to express challenging
Essid, Montacer, Solomon, Justin
core +1 more source
Optimizing navigational graph queries
The VLDB JournalAbstract We study the optimization of navigational graph queries in the form of the Regular Queries, i.e., queries which combine recursive and pattern-matching fragments. Current approaches to their evaluation are not effective in practice.
Thomas Mulder +2 more
openaire +3 more sources
Optimal regular graph designs [PDF]
Statistics and Computing, 2017 A typical problem in optimal design theory is finding an experimental design that is optimal with respect to some criteria in a class of designs. The most popular criteria include the A- and D-criteria. Regular graph designs occur in many optimality results and, if the number of blocks is large enough, they are A- and D-optimal.
openaire +3 more sources
COMP–PMEPA1 axis promotes epithelial‐to‐mesenchymal transition in breast cancer cells
Molecular Oncology, EarlyView.This study reveals that cartilage oligomeric matrix protein (COMP) promotes epithelial‐to‐mesenchymal transition (EMT) in breast cancer. We identify PMEPA1 (protein TMEPAI) as a novel COMP‐binding partner that mediates EMT via binding to the TSP domains of COMP, establishing the COMP–PMEPA1 axis as a key EMT driver in breast cancer.
Konstantinos S. Papadakos +6 more
wiley +1 more source
Frontiers in Complex SystemsResonance is a well-known phenomenon that happens in systems with second order dynamics. In this paper, we address the fundamental question of making a network robust to signal being periodically pumped into it at or near a resonant frequency by an ...
Alp Sahin +3 more
doaj +1 more source