default search action
João Paixão
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j3]João Paixão, Lucas Rufino, Pawel Sobocinski
:
High-level axioms for graphical linear algebra. Sci. Comput. Program. 218: 102791 (2022) - [c9]Tainá Guimarães de Souza, Mônica Ferreira da Silva, João Paixão, Renato M. B. Alves, Roberta Bordalo, Waldir Siqueira Moura:
Computational Linear Algebra to identify potential students with ADHD: pairing data compression and K-means. ICALT 2022: 262-263 - 2021
- [c8]Fabiano P. Martins, João A. R. Paixão, Claudio M. de Farias, Flávia Coimbra Delicato:
Hercules: A context-aware multiple application and multisensor data fusion algorithm. DASC/PiCom/CBDCom/CyberSciTech 2021: 197-200 - 2020
- [c7]João Paixão, Pawel Sobocinski:
Calculational Proofs in Relational Graphical Linear Algebra. SBMF 2020: 83-100 - [i8]Tiago Novello, João Paixão, Carlos Tomei, Thomas Lewiner:
Discrete Line Fields on Surfaces. CoRR abs/2002.07723 (2020)
2010 – 2019
- 2019
- [i7]Daniel Vieira, João Paixão:
Vector Field Neural Networks. CoRR abs/1905.07033 (2019) - 2018
- [c6]Daniel Vieira, Fábio Medeiros Rangel, Fabrício Firmino de Faria, João Paixão:
Vector Field Based Neural Networks. ESANN 2018 - [i6]João Paixão, Joao Lagoas, Thomas Lewiner, Tiago Novello:
Greedy Morse matchings and discrete smoothness. CoRR abs/1801.10118 (2018) - [i5]Daniel Vieira, Fábio Medeiros Rangel, Fabrício Firmino de Faria, João Paixão:
Vector Field Based Neural Networks. CoRR abs/1802.08235 (2018) - 2017
- [i4]Thomas Lewiner, Tiago Novello, João Paixão, Carlos Tomei:
Discrete Gradient Line Fields on Surfaces. CoRR abs/1712.08136 (2017) - 2016
- [j2]Benjamin A. Burton
Parameterized Complexity of Discrete Morse Theory. ACM Trans. Math. Softw. 42(1): 6:1-6:24 (2016) - 2015
- [i3]João Paixão, Jonathan Spreer
Random collapsibility and 3-sphere recognition. CoRR abs/1509.07607 (2015) - 2013
- [c5]Benjamin A. Burton
Computational topology and normal surfaces: Theoretical and experimental complexity bounds. ALENEX 2013: 78-87 - [c4]Benjamin A. Burton, Thomas Lewiner, João Paixão, Jonathan Spreer
Parameterized complexity of discrete morse theory. SoCG 2013: 127-136 - [i2]Benjamin A. Burton, Thomas Lewiner, João Paixão, Jonathan Spreer:
Parameterized Complexity of Discrete Morse Theory. CoRR abs/1303.7037 (2013) - 2012
- [i1]Benjamin A. Burton, João Paixão, Jonathan Spreer:
Computational topology and normal surfaces: Theoretical and experimental complexity bounds. CoRR abs/1211.3234 (2012) - 2011
- [j1]Thomas Lewiner
Stereo music visualization through manifold harmonics. Vis. Comput. 27(10): 905-916 (2011) - 2010
- [c3]Renata Nascimento, João Paixão, Hélio Lopes
Topology Aware Vector Field Denoising. SIBGRAPI 2010: 103-109 - [c2]Thomas Lewiner
Tuning Manifold Harmonics Filters. SIBGRAPI 2010: 110-117
2000 – 2009
- 2009
- [c1]João Paixão, Marcos Lage
Random Walks for Vector Field Denoising. SIBGRAPI 2009: 112-119
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: