Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,181 papers · 148 categories

Trend · papers per month

24477194 · Jun 202019922001200920182026
48 results for knot recognition

This is a report on our ongoing research on a combinatorial approach to knot recognition, using coloring of knots by certain algebraic objects called quandles. The aim of the paper is to summarize the mathematical theory of knot coloring in a compact, accessible manner, and to show how to use it for computational purpo…

2015-05-25abs ↗pdf ↗

A new type of knot energy is presented via real life experiments involving a thin resilient metallic tube. Knotted in different ways, the device mechanically acquires a uniquely determined (up to isometry) normal form at least when the original knot diagram has a small number of crossings, thus outperforming the famous…

2010-11-22abs ↗pdf ↗

We show that the problem of recognizing that a knot diagram represents a specific torus knot, or any torus knot at all, is in the complexity class NPco-NP{\sf NP} \cap {\sf co\text{-}NP}, assuming the generalized Riemann hypothesis. We also show that satellite knot detection is in NP{\sf NP} under the same assumption, and t…

2017-06-14abs ↗pdf ↗

We present a new, practical algorithm to test whether a knot complement contains a closed essential surface. This property has important theoretical and algorithmic consequences; however, systematically testing it has until now been infeasibly slow, and current techniques only apply to specific families of knots. As a …

2012-12-07abs ↗pdf ↗

The paper develops finite knot theory using ropelength-filtered Reidemeister graphs.

problem Understanding knot types in bounded ropelength sublevel spaces.
method Study thick representatives in bounded ropelength sublevel spaces through lifted Reidemeister graphs.
result Define characteristic Reidemeister patterns and finite recognition length.

We establish a characterization of alternating links in terms of definite spanning surfaces. We apply it to obtain a new proof of Tait's conjecture that reduced alternating diagrams of the same link have the same crossing number and writhe. We also deduce a result of Banks and Hirasawa-Sakuma about Seifert surfaces for…

2015-11-19abs ↗pdf ↗

Framework for reconstructing knot exterior surface complexes.

problem Understanding the mapping class group action on knot exteriors.
method Organizing rigidity questions, using a reduction principle, and classifying automorphisms.
result Common image-kernel bookkeeping and reconstruction framework for knot exteriors.

ReAPR simplifies hard unknots by reembedding and rerouting, revealing hidden simplifications.

problem Training AI to recognize knots, especially hard unknots, is challenging.
method Alternates pass-move reduction with geometric re-embedding, minimizing total variation of a height function.
result ReAPR successfully simplifies hard unknots, including Kauffman's challenge unknots, in under 30 seconds.

Study shows emotion affects speaker recognition and vice versa.

problem Dependencies between emotion and speaker recognition.
method Transfer learning and fine-tuning for emotion classification.
result Fine-tuning improves emotion recognition performance by 30.40% on IEMOCAP, 7.99% on MSP-Podcast, and 8.61% on Crema-D.

Paper proposes Roweisposes for 3D action recognition using generalized eigenvalue problem.

problem Need for basic methods in 3D action recognition.
method Roweisposes uses Roweis discriminant analysis for generalized subspace learning.
result Roweisposes is effective for 3D action recognition.

Paper tackles zero-shot activity recognition using video features and text embeddings.

problem Zero-shot activity recognition with videos.
method Auto-encoder model for multimodal joint embedding, 3D convolutional action recognition for visual features, GloVe word embeddings for textual features.
result Improved zero-shot recognition results with top-n accuracy and mean Nearest Neighbor Overlap.

Paper explores EEG-based speech recognition using transformers, showing faster training and better performance for smaller vocabularies.

problem Continuous speech recognition using EEG features.
method Transformer-based ASR model compared to RNN-based models.
result Transformer models perform better for smaller vocabularies but RNN models outperform them for larger vocabularies.

EmbraceNet fusion model for multi-sensor activity recognition.

problem Human activity recognition using multiple sensors is challenging.
method Independent processing of each sensor, feature fusion with EmbraceNet, post-processing, and additional processes.
result Improved performance in SHL recognition challenge.

We prove that the fundamental group of any integer homology 3-sphere different from the 3-sphere admits irreducible representations of its fundamental group in SL(2,C). For hyperbolic integer homology spheres this comes with the definition, and for Seifert fibered integer homology spheres this is well known. We prove t…

2016-05-27abs ↗pdf ↗

Neural network framework for language recognition considers sequence information and improves accuracy.

problem Challenging task of automatic language identification in noisy conditions.
method Proposes a neural network framework with bidirectional LSTM and attention modeling for relevance weighting.
result Significant improvements over conventional methods in noisy conditions and multi-speaker speech.

The paper presents a recognition system for Pashto letters using KNN and ANN.

problem Challenging handwritten character recognition, especially for Pashto letters.
method Designed a database of 4488 images, used zoning feature extractor, KNN, and ANN classifiers.
result Achieved overall classification accuracy of 70.05% using KNN and 72% using ANN.

Fawkes protects images from unauthorized facial recognition models.

problem Unauthorized training of facial recognition models poses privacy risks.
method Fawkes adds imperceptible pixel-level changes (cloaks) to images before release.
result Fawkes can protect images from misidentification by 95% and 80% even when clean images are leaked.

Paper shows continuous speech recognition with EEG features, no speech input.

problem Continuous speech recognition with limited vocabulary and noisy/no speech input.
method Connectionist temporal classification (CTC) model, EEG features, new deep learning architecture.
result Continuous speech recognition achieved on limited vocabulary with noisy/no speech input.

Paper proposes a framework to protect user anonymity in emotion recognition.

problem Preserving user anonymity in face-based emotion recognition systems.
method Adversarial learning framework using CNN architecture.
result The proposed approach minimizes identity-specific information and maximizes emotion-dependent information.

Learned feature representations and sub-phoneme posteriors from Deep Neural Networks (DNNs) have been used separately to produce significant performance gains for speaker and language recognition tasks. In this work we show how these gains are possible using a single DNN for both speaker and language recognition. The u…

2015-04-03abs ↗pdf ↗