Concept

Binary search algorithm

Related publications (174)

Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols

We show that the binary logarithm of the nonnegative rank of a nonnegative matrix is, up to small constants, equal to the minimum complexity of a randomized communication protocol computing the matrix in expectation. We use this connection to prove new con ...

Springer Berlin Heidelberg2012

In Tags We Trust: Trust modeling in social tagging of multimedia content

Touradj Ebrahimi, Jong Seok Lee, Ivan Ivanov, Péter Vajda

Tagging in online social networks is very popular these days, as it facilitates search and retrieval of multimedia content. However, noisy and spam annotations often make it difficult to perform an efficient search. Users may make mistakes in tagging and i ...

2012

Certification Aspects of the Fast Gradient Method for Solving the Dual of Parametric Convex Programs

Colin Neil Jones

This paper examines the computational complexity certification of the fast gradient method for the solution of the dual of a parametric con- vex program. To this end, a lower iteration bound is derived such that for all parameters from a compact set a solu ...

Springer Heidelberg2012

Designing Conversation-context Recommendation Display to Support Opportunistic Search in Meetings

Pierre Dillenbourg, Nan Li

In meetings, people sometimes come across information in the environment or in the conversation. This kind of ac- cidentally encountered information may be or not be rele- vant to the main meeting topic, but stirs people’s temporary interest and mediates g ...

ACM2012

Iterative Relevance Feedback with Adaptive Exploration/Exploitation Trade-off

François Fleuret, Nicolae Suditu

Content-based image retrieval systems have to cope with two different regimes: understanding broadly the categories of interest to the user, and refining the search in this or these categories to converge to specific images among them. Here, in contrast wi ...

2012

A New FFT-Based Algorithm for Secondary Code Acquisition for Galileo Signals

Pierre-André Farine, Cyril Botteron, Aleksandar Jovanovic, Jérôme Leclère, Youssef Tawk

The innovative spreading codes used to modulate the new Galileo signals creates new challenges for receiver designers. It is well known in GNSS systems that longer integration times are needed to obtain a better sensitivity. However, the existence of the n ...

IEEE2011

Efficiency of random search procedures along the silicon cluster series Sin (n=5-10, 15 and 20)

Fabrice Avaltroni

The efficiency of the simplest isomeric search procedure consisting in random generation of sets of atomic coordinates followed by density functional theory geometry optimization is tested on the silicon cluster series (Si-5-10,Si-15,Si-20). Criteria such ...

Wiley-Blackwell2011

Quantifying target conspicuity in contextual modulation by visual search

Michael Herzog, Bilge Sayim

Contextual elements can strongly modulate visual performance. For example, performance deteriorates when a vernier is flanked by neighboring lines. On a neural level, such contextual modulation is often explained by local spatial interactions such as later ...

Association for Research in Vision and Ophthalmology2011

Search for charmonium and charmoniumlike states in gamma(2S) radiative decays

Olivier Schneider, Yiming Li, Mingkui Wang, Chao Wang, Tagir Aushev, Jun Yong Kim, Remi Léandre Albert Louvot, Ji Hyun Kim, Xiao Wang, Jing Li, Xuan Li

Using a sample of 158 x 10(6) gamma (2S) events collected with the Belle detector, charmonium and charmoniumlike states with even charge parity are searched for in gamma (2S) radiative decays. No significant chi(cJ) or eta(c) signal is observed, and the fo ...

2011

Nonlocal Means With Dimensionality Reduction and SURE-Based Parameter Selection

Dimitri Nestor Alice Van De Ville, Michel Kocher

Nonlocal means (NLM) is an effective denoising method that applies adaptive averaging based on similarity between neighborhoods in the image. An attractive way to both improve and speed-up NLM is by first performing a linear projection of the neighborhood. ...

IEEE2011

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.