Ajay Kannan

  • Citations Per Year
Learn More
We present Deep Speaker, a neural speaker embedding system that maps utterances to a hypersphere where speaker similarity is measured by cosine similarity. The embeddings generated by Deep Speaker can be used for many tasks, including speaker identification, verification, and clustering. We experiment with ResCNN and GRU architectures to extract the(More)
Replacing hand-engineered pipelines with endto-end deep learning systems has enabled strong results in applications like speech and object recognition. However, the causality and latency constraints of production systems put end-to-end speech models back into the underfitting regime and expose biases in the model that we show cannot be overcome by “scaling(More)
Acute osmotic fluctuations in the brain occur during a number of clinical conditions and can result in a variety of adverse neurological symptoms. Osmotic perturbation can cause changes in the volumes of intra- and extracellular fluid and, due to the rigidity of the skull, can alter intracranial pressure thus making it difficult to analyze purely osmotic(More)
Authors often convey meaning by referring to or imitating prior works of literature, a process that creates complex networks of literary relationships ("intertextuality") and contributes to cultural evolution. In this paper, we use techniques from stylometry and machine learning to address subjective literary critical questions about Latin literature, a(More)
This paper presents a definition of convexity useful for describing local optimality in configuration spaces, proves that finding convex regions is relatively easy, and presents an algorithm for approximating the free configuration space using a set of such convex regions. The paper examines simple but interesting systems: serial planar arms with revolute(More)
This paper proposes sampling techniques to approximate the configuration space for optimal motion planning. We sample valid configurations in the workspace and construct path subconvex cells in the free configuration space. The radius of each cell is calculated using lower bounds on the robot’s minimum time to collision. Using theorems about path convexity,(More)
  • 1