◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Jorge F. Silva

15 papers hereh-index 14821 citations64 works total

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

author position
  • sole author2
  • first author2
  • middle author9
  • last author2

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

fields
  • astro-ph.IM6
  • cs.IT4
  • astro-ph.SR1
  • cs.LG1
  • math.ST1
  • stat.ME1
same name
  • Jorge F. Silva — 4 papers, h 2
  • Jorge F. Silva — 3 papers, h 2
  • Jorge F. Silva — 2 papers, h 1
  • Jorge F. Silva — 2 papers, h 1
  • Jorge F. Silva — 1 paper, h 2
  • Jorge F. Silva — 1 paper, h 1

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

activity
20132022
most citedOrbits for eighteen visual binaries and two double-line spectroscopic binaries observed with HRCAM on the CTIO SOAR 4m telescope, using a new Bayesian orbit code based on Markov Chain Monte Carlo

34 citations · 121 across the 14 of their papers we have counts for

collaborators
Showing 2017Show all

3 papers · 1 filter

cs.IT2017

Shannon Entropy Estimation in ∞-Alphabets from Convergence Results

Jorge F. Silva

The problem of Shannon entropy estimation in countable infinite alphabets is addressed from the study and use of convergence results of the entropy functional, which is known to be…

astro-ph.SR2017★ 34 cited

Orbits for eighteen visual binaries and two double-line spectroscopic binaries observed with HRCAM on the CTIO SOAR 4m telescope, using a new Bayesian orbit code based on Markov Chain Monte Carlo

Rene A. Mendez, Ruben M. Claveria, Marcos E. Orchard +1

We present orbital elements and mass sums for eighteen visual binary stars of spectral types B to K (five of which are new orbits) with periods ranging from 20 to more than 500 yr.…

cs.IT2017★ 5 cited

Universal Weak Variable-Length Source Coding on Countable Infinite Alphabets

Jorge F. Silva, Pablo Piantanida

Motivated from the fact that universal source coding on countably infinite alphabets is not feasible, this work introduces the notion of almost lossless source coding. Analog to th…

◍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.