Concept

Best-first search

Related publications (51)

A Galileo E1b,c RF Front-End Optimized for Narrowband Interferers Mitigation

Pierre-André Farine, Cyril Botteron, Frédéric Chastellain, Davide Manetti, Giuseppe Zamuner

The current Search and Rescue (SAR) service, which is based on the Cospas-Sarsat system, suffers from major limitations such as poor position accuracy, long alert times and high false alarm rate. Two types of distress signals are used, the first 121.5MHz/( ...

2006

Kernel Matching Pursuit for Large Datasets

Jean-Philippe Thiran, Vlad Popovici

Kernel matching pursuit is a greedy algorithm for building an approximation of a discriminant function as a linear combination of some basis functions selected from a kernel-induced dictionary. Here we propose a modification of the kernel matching pursuit ...

2005

Opportunistic search with semantic fisheye views

Pearl Pu Faltings

Search goals are often too complex or poorly defined to be solved with a single query in a Web-based information environment. In this paper we describe how we use semantic fisheye views (SFEVs) to effectively support opportunistic search and browsing strat ...

Springer-Verlag2004

Opportunistic Search with Semantic Fisheye Views

Pearl Pu Faltings

Search goals are often too complex or poorly defined to be solved in a single query. While refining their search goals, users are likely to apply a variety of strategies, such as searching for more general or more specific concepts in reaction to the infor ...

2004

Base Stations in Mobile Ad-Hoc Networks

Thomas Lochmatter

Multi-hop ad-hoc networks consist of nodes which cooperate by forwarding packets for each other to allow communication beyond the power range of each node. In pure ad-hoc networks, no additional infrastructure is required to allow the nodes to communicate. ...

2004

Power Efficient Gathering of Correlated Data: Optimization, NP-Completeness and Heuristics

Martin Vetterli, Razvan Cristescu

This paper studies the interaction between the communication costs in a sensor network and the structure of the data that it measures. We formulate an optimization problem definition for power efficient data gathering and assess its computational difficult ...

2003

Precision Isosurface Rendering of 3-D Image Data

Michaël Unser, Philippe Thévenaz

We address the task of rendering by ray tracing the isosurface of a high-quality continuous model of volumetric discrete and regular data. Based on first principles, we identify the quadratic B-spline as the best model for our purpose. The nonnegativity of ...

IEEE2003

Analysis of random processes via AND/OR tree evaluations

Mohammad Amin Shokrollahi

We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework for carrying out the analysis of several previously studied random processes ...

1998

Tracking elementary particles near their primary vertex: a combinatorial approach

Thomas Liebling

Colliding beams experiments High Energy Physics rely on solid state detectors to track the flight paths of charged elementary particles near their primary point of interaction. Reconstructing tracks in this region requires, per collision, a partitioning of ...

1996

From linear separability to unimodality: a hierarchy of pseudo-boolean functions

Dominique de Werra, Thomas Liebling

When an injective pseudo-Boolean function f:B^n -> R is minimized, where B^n=0,1^n is the set of vertices of the unit-hypercube, it is natural to consider so-called greedy vertex-following algorithms. These algorithms construct a sequence of neighbouring ( ...

1988

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.