The following pages link to Xuemin Lin (Q688446):
Displaying 25 items.
- A fast and effective heuristic for the feedback arc set problem (Q688447) (← links)
- (Q1324218) (redirect page) (← links)
- Database placement in communication networks for minimizing the overall transmission cost (Q1324221) (← links)
- A fully distributed quorum consensus method with high fault-tolerance and low communication overhead (Q1390954) (← links)
- (Q1575439) (redirect page) (← links)
- Spring algorithms and symmetry (Q1575440) (← links)
- Towards area requirements for drawing hierarchically planar graphs (Q1870562) (← links)
- Delay optimization in quorum consensus (Q1889604) (← links)
- An optimal voting scheme for minimizing the overall communication cost in replicated data management (Q1923392) (← links)
- On the computational complexity of edge concentration (Q1975372) (← links)
- Straight-line drawing algorithms for hierarchical graphs and clustered graphs (Q2492625) (← links)
- Asymmetric signature schemes for efficient exact edit similarity query processing (Q2943545) (← links)
- TWO TREE DRAWING CONVENTIONS (Q3136721) (← links)
- A graph based cluster approach for vertical partitioning in database design (Q4294518) (← links)
- (Q4364590) (← links)
- (Q4474123) (← links)
- (Q4525707) (← links)
- Hyperspectral Imagery Classification via Stochastic HHSVMs (Q4617914) (← links)
- Effective Multi-Query Expansions: Collaborative Deep Networks for Robust Landmark Retrieval (Q4618680) (← links)
- (Q4778744) (← links)
- (Q4858141) (← links)
- AN ALGORITHM FOR DRAWING A HIERARCHICAL GRAPH (Q4889503) (← links)
- (Q4999000) (← links)
- A highly fault-tolerant quorum consensus method for managing replicated data (Q6085705) (← links)
- Exploring cohesive subgraphs with vertex engagement and tie strength in bipartite graphs (Q6092095) (← links)
