• Publications
  • Influence
Common visual pattern discovery via spatially coherent correspondences
  • Hairong Liu, S. Yan
  • Mathematics, Computer Science
  • IEEE Computer Society Conference on Computer…
  • 13 June 2010
TLDR
We investigate how to discover all common visual patterns within two sets of feature points within a graph whose nodes represent potential correspondences and recover the correct correspondences. Expand
  • 145
  • 33
  • PDF
Fast Detection of Dense Subgraphs with Iterative Shrinking and Expansion
TLDR
In this paper, we propose an efficient algorithm to detect dense subgraphs of a weighted graph with low time and memory complexity. Expand
  • 43
  • 17
  • PDF
Robust Graph Mode Seeking by Graph Shift
TLDR
We study how to robustly compute the modes of a graph, namely the dense subgraphs, which characterize the underlying compact patterns and are useful for many applications. Expand
  • 79
  • 16
  • PDF
Exploring neural transducers for end-to-end speech recognition
TLDR
In this work, we perform an empirical comparison among the CTC, RNN-Transducer, and attention-based Seq2Seq models for end-to-end speech recognition. Expand
  • 135
  • 13
  • PDF
Convex shape decomposition
TLDR
We formalize the convex decomposition problem as an integer linear programming problem and obtain approximate optimal solution by minimizing the total cost of decomposition under some concavity constraints. Expand
  • 90
  • 12
  • PDF
Toward Large-Population Face Identification in Unconstrained Videos
TLDR
We investigate large-scale face identification in unconstrained videos with 1000 subjects. Expand
  • 42
  • 11
STACL: Simultaneous Translation with Implicit Anticipation and Controllable Latency using Prefix-to-Prefix Framework
TLDR
We propose a novel prefix-to-prefix framework for simultaneous translation that implicitly learns to anticipate in a single translation model. Expand
  • 54
  • 10
  • PDF
Robust Clustering as Ensembles of Affinity Relations
TLDR
A unified solution to clustering from k-ary affinity relations with k ≥ 2, that is, it applies to both graph-based and hypergraph-based clustering problems. Expand
  • 62
  • 7
  • PDF
Efficient structure detection via random consensus graph
  • Hairong Liu, S. Yan
  • Mathematics, Computer Science
  • IEEE Conference on Computer Vision and Pattern…
  • 16 June 2012
TLDR
We propose an efficient method to detect the underlying structures in data. Expand
  • 26
  • 7
  • PDF
STACL: Simultaneous Translation with Integrated Anticipation and Controllable Latency
TLDR
We introduce a very simple yet surprisingly effective “wait-k” model trained to generate the target sentence concurrently with the source sentence, but always k words behind, for any given k. Expand
  • 22
  • 7
  • PDF
...
1
2
3
4
5
...