Shape distributions
- R. Osada, T. Funkhouser, B. Chazelle, D. Dobkin
- Computer ScienceTOGS
- 1 October 2002
The dissimilarities between sampled distributions of simple shape functions provide a robust method for discriminating between classes of objects in a moderately sized database, despite the presence of arbitrary translations, rotations, scales, mirrors, tessellations, simplifications, and model degeneracies.
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- Nir Ailon, B. Chazelle
- Computer ScienceSymposium on the Theory of Computing
- 21 May 2006
A new low-distortion embedding of l<sub>2</sub><sup>d</sup> into l p (p=1,2) is introduced, called the Fast-Johnson-Linden-strauss-Transform (FJLT), based upon the preconditioning of a sparse projection matrix with a randomized Fourier transform.
The Fast Johnson--Lindenstrauss Transform and Approximate Nearest Neighbors
- Nir Ailon, B. Chazelle
- Computer ScienceSIAM journal on computing (Print)
- 1 May 2009
A new low-distortion embedding of $\ell-2^d$ into $\ell_p^{O(\log n)}$ ($p=1,2$) called the fast Johnson-Lindenstrauss transform (FJLT) is introduced, based upon the preconditioning of a sparse projection matrix with a randomized Fourier transform.
Matching 3D models with shape distributions
- R. Osada, T. Funkhouser, B. Chazelle, D. Dobkin
- Computer ScienceProceedings International Conference on Shape…
- 7 May 2001
The primary motivation for this approach is to reduce the shape matching problem to the comparison of probability distributions, which is simpler than traditional shape matching methods that require pose registration, feature correspondence or model fitting.
Cutting hyperplanes for divide-and-conquer
- B. Chazelle
- Mathematics, Computer ScienceDiscrete & Computational Geometry
- 1 February 1993
A deterministic algorithm for computing a (1/r)-cutting ofO(rd) size inO(nrd−1) time is presented, based on a hierarchical construction of cuttings, which also provides a simple optimal data structure for locating a point in an arrangement of hyperplanes.
Triangulating a simple polygon in linear time
- B. Chazelle
- Computer ScienceProceedings [] 31st Annual Symposium on…
- 1 December 1991
A deterministic algorithm for triangulating a simple polygon in linear time is given, using the polygon-cutting theorem and the planar separator theorem, whose role is essential in the discovery of new diagonals.
Filtering search: A new approach to query-answering
- B. Chazelle
- Computer Science, Mathematics24th Annual Symposium on Foundations of Computer…
- 7 November 1983
We introduce a new technique for solving problems of the following form: preprocess a set of objects so that those satisfying a given property with respect to a query object can be listed very…
A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- B. Chazelle
- Computer ScienceSIAM journal on computing (Print)
- 1 June 1988
These results include, in particular, linear-size data structures for range and rectangle counting in two dimensions with logarithmic query time and a redefinition of data structures in terms of functional specifications.
The discrepancy method - randomness and complexity
- B. Chazelle
- Computer Science
- 24 July 2000
This book tells the story of the discrepancy method in a few short independent vignettes. It is a varied tale which includes such topics as communication complexity, pseudo-randomness, rapidly mixing…
Whole-proteome prediction of protein function via graph-theoretic analysis of interaction maps
- E. Nabieva, Kam-Chuen Jim, A. Agarwal, B. Chazelle, Mona Singh
- BiologyIntelligent Systems in Molecular Biology
- 2005
A network-flow based algorithm, FunctionalFlow, is developed that exploits the underlying structure of protein interaction maps in order to predict protein function and has improved performance over previous methods in predicting the function of proteins with few (or no) annotated protein neighbors.
...
...