Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Maio, Roland"'
Autor:
Maio, Roland
Machine learning promises to unlock troves of economic value. As advanced machine-learning techniques proliferate, they raise acute fairness concerns. These concerns must be addressed in order for the economic surpluses and externalities generated by
Autor:
Yasar, Ayse Gizem, Chong, Andrew, Dong, Evan, Gilbert, Thomas Krendl, Hladikova, Sarah, Maio, Roland, Mougan, Carlos, Shen, Xudong, Singh, Shubham, Stoica, Ana-Andreea, Thais, Savannah, Zilka, Miri
As AI technology advances rapidly, concerns over the risks of bigness in digital markets are also growing. The EU's Digital Markets Act (DMA) aims to address these risks. Still, the current framework may not adequately cover generative AI systems tha
Externí odkaz:
http://arxiv.org/abs/2308.02033
The United Nations Consumer Protection Guidelines lists "access ... to adequate information ... to make informed choices" as a core consumer protection right. However, problematic online reviews and imperfections in algorithms that detect those revie
Externí odkaz:
http://arxiv.org/abs/2202.09005
Autor:
Finocchiaro, Jessie, Maio, Roland, Monachou, Faidra, Patro, Gourab K, Raghavan, Manish, Stoica, Ana-Andreea, Tsirtsis, Stratis
Decision-making systems increasingly orchestrate our world: how to intervene on the algorithmic components to build fair and equitable systems is therefore a question of utmost importance; one that is substantially complicated by the context-dependen
Externí odkaz:
http://arxiv.org/abs/2010.05434
Autor:
Cleary, Sean, Maio, Roland
It is an open question whether there exists a polynomial-time algorithm for computing the rotation distances between pairs of extended ordered binary trees. The problem of computing the rotation distance between an arbitrary pair of trees, (S, T), ca
Externí odkaz:
http://arxiv.org/abs/2001.06422
Autor:
Cleary, Sean, Maio, Roland
Rotation distance between rooted binary trees is the minimum number of simple rotations needed to transform one tree into the other. Computing the rotation distance between a pair of rooted trees can be quickly reduced in cases where there is a commo
Externí odkaz:
http://arxiv.org/abs/2001.06407
Autor:
Cleary, Sean, Maio, Roland
Publikováno v:
SIAM J. Discrete Math., 32(2), 1003-1015. 2018
There are no known efficient algorithms to calculate distance in the one-skeleta of associahedra, a problem that is equivalent to finding rotation distance between rooted binary trees or the flip distance between polygonal triangulations. One measure
Externí odkaz:
http://arxiv.org/abs/1510.07584
Autor:
Cleary, Sean, Maio, Roland
Publikováno v:
Acta Cybernetica; 2022, Vol. 25 Issue 3, p629-646, 18p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.