Hugginggpt: Solving ai tasks with chatgpt and its friends in hugging face

Y Shen, K Song, X Tan, D Li, W Lu… - Advances in Neural …, 2024 - proceedings.neurips.cc
Solving complicated AI tasks with different domains and modalities is a key step toward
artificial general intelligence. While there are numerous AI models available for various …

[PDF][PDF] Performance evaluation of deep neural networks applied to speech recognition: RNN, LSTM and GRU

A Shewalkar, D Nyavanandi, SA Ludwig - Journal of Artificial …, 2019 - sciendo.com
Abstract Deep Neural Networks (DNN) are nothing but neural networks with many hidden
layers. DNNs are becoming popular in automatic speech recognition tasks which combines …

Robustfill: Neural program learning under noisy i/o

J Devlin, J Uesato, S Bhupatiraju… - International …, 2017 - proceedings.mlr.press
The problem of automatically generating a computer program from some specification has
been studied since the early days of AI. Recently, two competing approaches forautomatic …

[图书][B] Pattern classification

RO Duda, PE Hart - 2006 - books.google.com
Market_Desc:· Senior and Graduate level courses· Professionals in Computer Science and
Electrical Engineering· Researchers in speech recognition, optical character recognition …

A normalized Levenshtein distance metric

L Yujian, L Bo - IEEE transactions on pattern analysis and …, 2007 - ieeexplore.ieee.org
Although a number of normalized edit distances presented so far may offer good
performance in some applications, none of them can be regarded as a genuine metric …

[图书][B] Grammatical inference: learning automata and grammars

C De la Higuera - 2010 - books.google.com
The problem of inducing, learning or inferring grammars has been studied for decades, but
only in recent years has grammatical inference emerged as an independent field with …

A survey of graph edit distance

X Gao, B Xiao, D Tao, X Li - Pattern Analysis and applications, 2010 - Springer
Inexact graph matching has been one of the significant research foci in the area of pattern
analysis. As an important way to measure the similarity between pairwise graphs error …

Learning string-edit distance

ES Ristad, PN Yianilos - IEEE Transactions on Pattern Analysis …, 1998 - ieeexplore.ieee.org
In many applications, it is necessary to determine the similarity of two strings. A widely-used
notion of string similarity is the edit distance: the minimum number of insertions, deletions …

Sequence of the most informative joints (smij): A new representation for human skeletal action recognition

F Ofli, R Chaudhry, G Kurillo, R Vidal… - Journal of Visual …, 2014 - Elsevier
Much of the existing work on action recognition combines simple features with complex
classifiers or models to represent an action. Parameters of such models usually do not have …

On nonmetric similarity search problems in complex domains

T Skopal, B Bustos - ACM Computing Surveys (CSUR), 2011 - dl.acm.org
The task of similarity search is widely used in various areas of computing, including
multimedia databases, data mining, bioinformatics, social networks, etc. In fact, retrieval of …