Sergey Mastitsky

Sergey Mastitsky

NLP

73 stories

Sergey Mastitsky

Sergey Mastitsky

MLOps

8 stories

Sergey Mastitsky

Sergey Mastitsky

Graphs

1 story

Linear Processes for DAGs:Vertices and Edges with no cycles: G=(V,E) Topological Sort: V1 ,V2 ,…,Vn where for each (Vi ,Vj )∈E,i<j Linear relationship: This denotes a linear, directed path suitable for representing processes and workflows without cycles. Ontologies in Semantic Knowledge Graphs: Triples representing relationships: T = \{(s, p, o) mid s, p, o \in URI \text{ or } Literal } T={(s,p,o)∣s,p,o∈URI or Literal} Ontologies connecting data points across domains: O={C,R} C are concepts and
Sergey Mastitsky

Sergey Mastitsky

ML

6 stories

Sergey Mastitsky

Sergey Mastitsky

Faces

1 story

Sergey Mastitsky

Sergey Mastitsky

RAG

2 stories

Sergey Mastitsky

Sergey Mastitsky

Rust

2 stories

Sergey Mastitsky

Sergey Mastitsky

setfit

1 story

Sergey Mastitsky

Sergey Mastitsky

Python

1 story

Sergey Mastitsky

Sergey Mastitsky

Search engines

4 stories

Sergey Mastitsky

Sergey Mastitsky

BTYD

2 stories

Sergey Mastitsky

Sergey Mastitsky

Universe

1 story

Sergey Mastitsky

Sergey Mastitsky

Jobs

1 story

Sergey Mastitsky

Sergey Mastitsky

AWS

6 stories