Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Widad Machmouchi"'
Autor:
Laura Dietz, Bhaskar Mitra, Jeremy Pickens, Hana Anber, Sandeep Avula, Asia Biega, Adrian Boteanu, Shubham Chatterjee, Jeff Dalton, Shiri Dori-Hacohen, John Foley, Henry Feild, Ben Gamari, Rosie Jones, Pallika Kanani, Sumanta Kashyapi, Widad Machmouchi, Matthew Mitsui, Steve Nole, Alexandre Tachard Passos, Jordan Ramsdell, Adam Roegiest, David Smith, Alessandro Sordoni
Publikováno v:
ACM SIGIR Forum. 53:62-75
The vision of HIPstIR is that early stage information retrieval (IR) researchers get together to develop a future for non-mainstream ideas and research agendas in IR. The first iteration of this vision materialized in the form of a three day workshop
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::782cc629721c628bc77967a5c1371efa
https://doi.org/10.1145/3458553.3458560
https://doi.org/10.1145/3458553.3458560
Publikováno v:
CIKM
User satisfaction metrics are an integral part of search engine development as they help system developers to understand and evaluate the quality of the user experience. Research to date has mostly focused on predicting success or frustration as a pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf421ab0fa9674cf43b563895b71c955
https://doi.org/10.1145/3132847.3132850
https://doi.org/10.1145/3132847.3132850
Autor:
Widad Machmouchi, Georg Buscher
Publikováno v:
SIGIR
In this paper, we describe principles for designing metrics in the context of A/B experiments. We share some issues that comes up in designing such experiments and provide solutions to avoid such pitfalls.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea4bbc0da07970cc24b39059f2bee4ae
https://doi.org/10.1145/2911451.2926731
https://doi.org/10.1145/2911451.2926731
Publikováno v:
FOCS
We derive new time-space tradeoff lower bounds and algorithms for exactly computing statistics of input data, including frequency moments, element distinctness, and order statistics, that are simple to calculate for sorted data. We develop a randomiz
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1e700480f8f8bfe8a4a58f08bb218a79
Autor:
Widad Machmouchi, Paul Beame
Publikováno v:
IEEE Conference on Computational Complexity
We prove a time-space tradeoff lower bound of $T =\Omega\left(n\log(\frac{n}{S}) \log \log(\frac{n}{S})\right) $ forrandomized oblivious branching programs to compute $1GAP$, alsoknown as the pointer jumping problem, a problem for which there is asim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af1613fdb52390714dea4ff29ddcfd7c
https://doi.org/10.1109/ccc.2011.35
https://doi.org/10.1109/ccc.2011.35
Autor:
Paul Beame, Widad Machmouchi
We show that any quantum algorithm deciding whether an input function $f$ from $[n]$ to $[n]$ is 2-to-1 or almost 2-to-1 requires $\Theta(n)$ queries to $f$. The same lower bound holds for determining whether or not a function $f$ from $[2n-2]$ to $[
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::478accde4de5bf5ad82b96f7a13a75f4
http://arxiv.org/abs/1008.2422
http://arxiv.org/abs/1008.2422
Autor:
Widad Machmouchi
Publikováno v:
ISIT
We prove that q-ary sparse codes with small bias are self-correctable and locally testable. We generalize a result of Kaufman and Sudan [3] that proves the local testability and correctability of binary sparse codes with small bias. We use properties
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::57422395cf5ef8685aac408248f1e146
Autor:
Trippas, Johanne, Maxwel, David, Alqatan, Abdulaziz, Boom, Miriam, Chavula, Catherine, Crescenzi, Anita, Ibáñez, Luis-Daniel, Meyer, Selina, Ortloff, Anna-Marie, Palani, Srishti, Patel, Dolinkumar, Thode, Wiebke, Xing, Zhaopeng
Publikováno v:
SIGIR Forum; Jun2022, Vol. 56 Issue 1, p1-10, 10p
Autor:
BAZZI, LOUAY M. J.1 Louay.Bazzi@aub.edu.lb
Publikováno v:
SIAM Journal on Computing. 2009, Vol. 38 Issue 6, p2220-2272. 53p. 2 Charts.
Autor:
Mitra, Bhaskar, Craswell, Nick
Publikováno v:
Foundations & Trends in Information Retrieval; 2019, Vol. 13 Issue 1, p98-98, 1p