Concept

Yahoo! Search

Related publications (134)

Observation of B0→ΛΛ¯K0 and B0→ΛΛ¯K*0 at Belle

Olivier Schneider, Aurelio Bay, Mingkui Wang, Chao Wang, Tagir Aushev, Vladislav Balagura, Remi Léandre Albert Louvot, Xiao Wang

We study the charmless decays B -> Lambda(Lambda) over barh , where h stands for pi(+), K+, K-0, K*(+), or K*(0), using a 605 fb(-1) data sample collected at the Gamma(4S) resonance with the Belle detector at the KEKB asymmetric energy e(+)e(-) collider. W ...

2009

Distributed Similarity Search in High Dimensions Using Locality Sensitive Hashing

Karl Aberer, Sebastian Michel, Parisa Haghani

In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH) which has proven very efficient in answering KNN queries in centralized set ...

2009

Search for the X(1812) in B±→K±ωϕ

Olivier Schneider, Aurelio Bay, Chao Wang, Tagir Aushev, Remi Léandre Albert Louvot, Xiao Wang, Jing Li

We report on a search for the X(1812) state in the decay B-+/--> K-+/-omega phi with a data sample of 657x10(6) BB pairs collected with the Belle detector at the KEKB e(+)e(-) collider. No significant signal is observed. An upper limit ...

2009

Catalogues of radial and rotational velocities of 1253 F-K dwarfs in 13 nearby open clusters

Jean-Claude Mermilliod

Context. We conducted a long-term monitoring of solar-type dwarfs in 13 nearby open clusters, d < 500 pc, over 19 years, but most individual radial velocities were never published, apart from a small number of spectroscopic binaries. Aims. Our program was ...

2009

Complexity of stochastic branch and bound methods for belief tree search in Bayesian reinforcement learning

Christos Dimitrakakis

There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most problems of interest, the optimal solution involves planning in an infinite ...

2009

COMPLEXITY OF STOCHASTIC BRANCH AND BOUND METHODS FOR BELIEF TREE SEARCH IN BAYESIAN REINFORCEMENT LEARNING

Christos Dimitrakakis

2009

Vectorcardiography based analysis of atrial fibrillation

This paper discusses the feasibility and effectiveness of using vectors of the current dipoles representing local electric activity inside the atrial myocardium during atrial fibrillation. The application relates to the search for improving the performance ...

JAKS Publishing Company2009

Information Percolation with Equilibrium Search Dynamics

Semyon Malamud, Darrell Duffie

We solve for the equilibrium dynamics of Information sharing in a large population Each agent is endowed with signals regarding the likely outcome of a random variable of common concern Individuals choose the effort with which they search for others from w ...

2009

ResIn: A Combination of Result Caching and Index Pruning for High-performance Web Search Engines

Gleb Skobeltsyn

Results caching is an efficient technique for reducing the query processing load, hence it is commonly used in real search engines. This technique, however, bounds the maximum hit rate due to the large fraction of singleton queries, which is an important l ...

2008

Web page language identification based on URLs

Monika Henzinger, Ingmar Weber, Eda Baykan

Given only the URL of a web page, can we identify its language? This is the question that we examine in this paper. Such a language classifier is, for example, useful for crawlers of web search engines, which frequently try to satisfy certain language quot ...

2008

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.