Sciweavers

328 search results - page 31 / 66
» Deterministic k-set structure
Sort
View
SODA
2000
ACM
127views Algorithms» more  SODA 2000»
13 years 8 months ago
Dimensionality reduction techniques for proximity problems
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
Piotr Indyk
ENTCS
2010
133views more  ENTCS 2010»
13 years 7 months ago
Towards Measurable Types for Dynamical Process Modeling Languages
Process modeling languages such as "Dynamical Grammars" are highly expressive in the processes they model using stochastic and deterministic dynamical systems, and can b...
Eric Mjolsness
CCE
2005
13 years 7 months ago
Computer-aided molecular design using Tabu search
A detailed implementation of the Tabu Search (TS) algorithm for computer-aided molecular design (CAMD) of transition metal catalysts is presented in this paper. Previous CAMD rese...
Bao Lin, Sunitha Chavali, Kyle V. Camarda, David C...
JMLR
2010
115views more  JMLR 2010»
13 years 5 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
ESA
2011
Springer
251views Algorithms» more  ESA 2011»
12 years 7 months ago
Improved Approximation Algorithms for Bipartite Correlation Clustering
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke...