Publications related to Right-Protected Data Publishing with Provable Distance-Based Mining

On Computing Breakpoint Distances for Genomes with Duplicate Genes

A fundamental problem in comparative genomics is to compute the distance between two genomes in terms of its higher level organization (given by genes or syntenic blocks). For two genomes without duplicate genes, we can easily define (and almost always eff ...

Mary Ann Liebert, Inc2017

Approximation algorithms for geometric dispersion

Alfonso Bolívar Cevallos Manzano

The most basic form of the max-sum dispersion problem (MSD) is as follows: given n points in R^q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This is a prominent diversity problem, with w ...

EPFL2016

Fast K-Means with Accurate Bounds

François Fleuret, James Peter Newling

We propose a novel accelerated exact

k

-means algorithm, which outperforms the current state-of-the-art low-dimensional algorithm in 18 of 22 experiments, running up to 3

\times

faster. We also propose a general improvement of existing state-of-the-art a ...

Idiap2016

Sparse Group Covers and Greedy Tree Approximations

Volkan Cevher, Luca Baldassarre

We consider the problem of finding a K-sparse approximation of a signal, such that the support of the approximation is the union of sets from a given collection, a.k.a. group structure. This problem subsumes the one of finding K-sparse tree approximations. ...

2015

Indoor localization method and system

Martin Vetterli, Reza Parhizkar, Gilles Baechler

An indoor localization method for estimating the location of nodes (n1, n2), at least one node (n1) being connected to at least another node (n2) by at least two different channels (ch1, ch1′), comprising the following steps: measuring a distance between t ...

2015

Theoretical Analysis of Euclidean Distance Matrix Completion for Ad hoc Microphone Array Calibration

Mohammadjavad Taghizadeh

We consider the problem of ad~hoc microphone array calibration where the distance matrix consisted of all microphones pairwise distances have entries missing corresponding to distances greater than

d_{\text{max}}

. Furthermore, the known entries are noisy ...

Idiap2014

Distributed spatiotemporal suppression for environmental data collection in real-world sensor networks

Alcherio Martinoli, Alexander Bahr, William Christopher Evans

Environmental processes are often severely over-sampled. As sensor networks become more ubiquitous for this purpose, increasing network longevity becomes ever more important. Radio transceivers in particular are a great source of energy consumption, and ma ...

Ieee Computer Soc2013

An Efficient Algorithm for Level Set Method Preserving Distance Function

Jean-Philippe Thiran, Xavier Bresson, Dominique Zosso, Virginia Estellers Casas

The level set method is a popular technique for tracking moving interfaces in several disciplines including computer vision and fluid dynamics. However, despite its high flexibility, the original level set method is limited by two important numerical issue ...

Institute of Electrical and Electronics Engineers2012

Thick Boundaries in Binary Space and Their Influence on Nearest-Neighbor Search

Pascal Fua, Vincent Lepetit, Tomasz Piotr Trzcinski

Binary descriptors allow faster similarity computation than real-valued ones while requiring much less storage. As a result, many algorithms have recently been proposed to binarize ﬂoating-point descriptors so that they can be searched for quickly. Unfortu ...

Elsevier2012

Dynamically Selecting Composition Algorithms for Economical Composition as a Service

Boi Faltings, Immanuel Trummer

Various algorithms have been proposed for the problem of quality-driven service composition. They differ by the quality of the resulting executable processes and by their processing costs. In this paper, we study the problem of service composition from an ...

Springer-Verlag Berlin2011

Right-Protected Data Publishing with Provable Distance-Based Mining

Graph Chatbot

Chat with Graph Search

On Computing Breakpoint Distances for Genomes with Duplicate Genes

Approximation algorithms for geometric dispersion

Fast K-Means with Accurate Bounds

Sparse Group Covers and Greedy Tree Approximations

Indoor localization method and system

Theoretical Analysis of Euclidean Distance Matrix Completion for Ad hoc Microphone Array Calibration

Distributed spatiotemporal suppression for environmental data collection in real-world sensor networks

An Efficient Algorithm for Level Set Method Preserving Distance Function

Thick Boundaries in Binary Space and Their Influence on Nearest-Neighbor Search

Dynamically Selecting Composition Algorithms for Economical Composition as a Service

Fast K-Means with Accurate Bounds

An Efficient Algorithm for Level Set Method Preserving Distance Function

Theoretical Analysis of Euclidean Distance Matrix Completion for Ad hoc Microphone Array Calibration

On Computing Breakpoint Distances for Genomes with Duplicate Genes

Distributed spatiotemporal suppression for environmental data collection in real-world sensor networks

Thick Boundaries in Binary Space and Their Influence on Nearest-Neighbor Search

Dynamically Selecting Composition Algorithms for Economical Composition as a Service

Sparse Group Covers and Greedy Tree Approximations

Indoor localization method and system

Approximation algorithms for geometric dispersion