research
∙
07/04/2023
Mutual Information Analysis for Factor Graph-based MIMO Iterative Detections through Error Functions
The factor graph (FG) based iterative detection is considered an effecti...
share
research
∙
06/02/2023
DVFO: Learning-Based DVFS for Energy-Efficient Edge-Cloud Collaborative Inference
Due to limited resources on edge and different characteristics of deep n...
research
∙
05/01/2023
BCEdge: SLO-Aware DNN Inference Services with Adaptive Batching on Edge Platforms
As deep neural networks (DNNs) are being applied to a wide range of edge...
research
∙
04/18/2023
Contact Tracing over Uncertain Indoor Positioning Data (Extended Version)
Pandemics often cause dramatic losses of human lives and impact our soci...
research
∙
02/25/2023
Data Imputation for Sparse Radio Maps in Indoor Positioning (Extended Version)
Indoor location-based services rely on the availability of sufficiently ...
research
∙
02/23/2023
LightCTS: A Lightweight Framework for Correlated Time Series Forecasting
Correlated time series (CTS) forecasting plays an essential role in many...
research
∙
02/08/2023
Resistance Distances in Directed Graphs: Definitions, Properties, and Applications
Resistance distance has been studied extensively in the past years, with...
research
∙
09/16/2022
On Weighted Graph Sparsification by Linear Sketching
A seminal work of [Ahn-Guha-McGregor, PODS'12] showed that one can compu...
research
∙
08/13/2022
Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Models
Adaptive gradient algorithms borrow the moving average idea of heavy bal...
research
∙
08/08/2022
Bridging the Gap: Commonality and Differences between Online and Offline COVID-19 Data
With the onset of the COVID-19 pandemic, news outlets and social media h...
research
∙
07/19/2022
On Regularity Lemma and Barriers in Streaming and Dynamic Matching
We present a new approach for finding matchings in dense graphs by build...
research
∙
01/27/2022
Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the O(ε^-7/4) Complexity
This paper studies the accelerated gradient descent for general nonconve...
research
∙
04/12/2021
Towards Crowd-aware Indoor Path Planning (Extended Version)
Indoor venues accommodate many people who collectively form crowds. Such...
research
∙
04/06/2021
Accelerated Gradient Tracking over Time-varying Graphs for Decentralized Optimization
Decentralized optimization over time-varying graphs has been increasingl...
research
∙
01/15/2021
Impact of COVID-19 on Adoption of IoT in Different Sectors
COVID-19 has disrupted normal life and has enforced a substantial change...
research
∙
10/08/2020
An Experimental Analysis of Indoor Spatial Queries: Modeling, Indexing, and Processing
Indoor location-based services (LBS), such as POI search and routing, ar...
research
∙
09/09/2020
Variance Reduced EXTRA and DIGing and Their Optimal Acceleration for Strongly Convex Decentralized Optimization
We study stochastic decentralized optimization for the problem of traini...
research
∙
06/23/2020
An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs
We give the first polynomial-time approximation scheme (PTAS) for the st...
research
∙
02/24/2020
Revisiting EXTRA for Smooth Distributed Optimization
EXTRA is a popular method for the dencentralized distributed optimizatio...
research
∙
08/06/2019
Hermitian matrices for clustering directed graphs: insights and applications
Graph clustering is a basic technique in machine learning, and has wides...
research
∙
11/27/2018
Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem
We study spectral approaches for the MAX-2-LIN(k) problem, in which we a...
research
∙
10/07/2018
Spectral Subspace Sparsification
We introduce a new approach to spectral sparsification that approximates...
research
∙
10/03/2018
Optimization Algorithm Inspired Deep Neural Network Structure Design
Deep neural networks have been one of the dominant machine learning appr...
research
∙
04/09/2018
Maximizing the Number of Spanning Trees in a Connected Graph
We study the problem of maximizing the number of spanning trees in a con...
research
∙
03/02/2018
Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket
As a fundamental subject of theoretical computer science, the maximum in...
research
∙
02/07/2018
Current Flow Group Closeness Centrality for Complex Networks
Current flow closeness centrality (CFCC) has a better discriminating abi...
research
∙
09/14/2017
Extended corona product as an exactly tractable model for weighted heterogeneous networks
Various graph products and operations have been widely used to construct...
research
∙
09/13/2017
Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs
The Apollonian networks display the remarkable power-law and small-world...
research
∙
06/17/2016
