◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Renato Cordeiro de Amorim

2 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author1

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • cs.LG1
  • math.CO1
ORCID 0000-0002-6805-4609
same name
  • Renato Cordeiro de Amorim — 3 papers, h 15
  • Renato Cordeiro de Amorim — 2 papers, h 0

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

most citedA-Ward_p\b{eta}: Effective hierarchical clustering using the Minkowski metric and a fast k -means initialisation

18 citations · 18 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2023

On large sum-free sets: revised bounds and patterns

Renato Cordeiro de Amorim

In this paper we rectify two previous results found in the literature. Our work leads to a new upper bound for the largest sum-free subset of [1,n] with lowest value in $\left [\…

cs.LG2016★ 18 cited

A-Ward_p\b{eta}: Effective hierarchical clustering using the Minkowski metric and a fast k -means initialisation

Renato Cordeiro de Amorim, Vladimir Makarenkov, Boris Mirkin

In this paper we make two novel contributions to hierarchical clustering. First, we introduce an anomalous pattern initialisation method for hierarchical clustering algorithms, cal…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.