Publication

On the complexity of fixed parameter clique and dominating set

Related publications (108)

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.

Fast spin +-2 spherical harmonics transforms and application in cosmology

Pierre Vandergheynst, Yves Wiaux, Laurent Jacques

A fast and exact algorithm is developed for the spin +-2 spherical harmonics transforms on equi-angular pixelizations on the sphere. It is based on the Driscoll and Healy fast scalar spherical harmonics transform. The theoretical exactness of the transform ...

2007

Refined Quorum Systems

Rachid Guerraoui, Marko Vukolic

It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform fast if few failures occur, the system is synchronous and there is no contenti ...

2007

Refined Quorum Systems

Rachid Guerraoui, Marko Vukolic

2007

Tracking Atoms with Particles

Pierre Vandergheynst, Gianluca Monaci, Emilio Maggio

We present a general framework and an efficient algorithm for tracking relevant video structures. The structures to be tracked are implicitly defined by a Matching Pursuit procedure that extracts and ranks the most important image contours. Based on the ra ...

2006

Robust Transmission of H.264/AVC Streams Using Adaptive Group Slicing and Unequal Error Protection

Nikolaos Thomos

We present a novel scheme for the transmission of H.264/AVC video streams over lossy packet networks. The proposed scheme exploits the error-resilient features of H.264/AVC codec and employs Reed-Solomon codes to protect effectively the streams. A novel te ...

2006

On the facet-to-facet property of solutions to convex parametric quadratic programs

Colin Neil Jones

In some of the recently developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regions is a facet of both closures; this will be referred to as the facet-to-face ...

Elsevier2006

On the facet-to-facet property of solutions to convex parametric quadratic programs

Colin Neil Jones

2006

Robust Echo Control Using a Simple Echo Path Model

Christof Faller, Christophe Tournery

In handsfree tele or video conferencing acoustic echoes arise due to the coupling between the loudspeaker and microphone. Usually an acoustic echo canceler (AEC) is used for eliminating the undesired echoes. The weaknesses of AEC are that it is relatively ...

2006

Finding near-duplicate web pages: A large-scale evaluation of algorithms

Monika Henzinger

Broder et al.'s [3] shingling algorithm and Charikar's [4] random projection based approach are considered "state-of-the-art" algorithms for finding near-duplicate web pages. Both algorithms were either developed at or used by popular web search engines. W ...

ACM Press2006

High Level Extraction of SoC Architectural Information from Generic C Algorithmic Descriptions

Marco Mattavelli, Massimo Ravasi

The complexity of nowadays, algorithms in terms of number of lines of codes and cross-relations among processing algorithms that are activated by specific input signals, goes far beyond what the designer can reasonably grasp from the “pencil & paper” analy ...

IEEE2005