| 
| |  | |  |
Similarity Search in High Dimensions via Hashing
Note: Links lead to the DBLP on the Web.
Piotr Indyk
25
Piotr Indyk: A Sublinear Time Approximation Scheme for Clustering in Metric Spaces.
FOCS 1999
: 154-159
24
Arnon Amir
,
Alon Efrat
, Piotr Indyk,
Hanan Samet
: Efficient Regular Data Structures and Algorithms for Location and Proximity Problems.
FOCS 1999
: 160-170
23
Martin Farach-Colton
, Piotr Indyk: Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings.
FOCS 1999
: 171-180
22
Ashish Goel
, Piotr Indyk: Stochastic Load Balancing and Related Problems.
FOCS 1999
: 579-586
21
Richard Cole
,
Ramesh Hariharan
, Piotr Indyk: Tree Pattern Matching and Subset Matching in Deterministic
O
(
n
log
3
n
)-time.
SODA 1999
: 245-254
20
Piotr Indyk: A Small Approximately min-wise Independent Family of Hash Functions.
SODA 1999
: 454-456
19
Piotr Indyk,
Rajeev Motwani
,
Suresh Venkatasubramanian
: Geometric Matching Under Noise: Combinatorial Bounds and Algorithms.
SODA 1999
: 457-465
18
Piotr Indyk: Sublinear Time Algorithms for Metric Space Problems.
STOC 1999
: 428-434
17
Piotr Indyk: Inerpolation of Symmetric Functions and a New Type of Combinatorial Design.
STOC 1999
: 736-740
16
Martin Gavrilov
, Piotr Indyk,
Rajeev Motwani
,
Suresh Venkatasubramanian
: Geometric Pattern Matching: A Performance Study.
Symposium on Computational Geometry 1999
: 79-85
15
Aristides Gionis
, Piotr Indyk,
Rajeev Motwani
: Similarity Search in High Dimensions via Hashing.
VLDB 1999
: 518-529
14
Piotr Indyk: On Approximate Nearest Neighbors in Non-Euclidean Spaces.
FOCS 1998
: 148-155
13
Piotr Indyk: Faster Algorithms for String Matching Problems: Matching the Convolution Bound.
FOCS 1998
: 166-173
12
Soumen Chakrabarti
,
Byron Dom
, Piotr Indyk: Enhanced Hypertext Categorization Using Hyperlinks.
SIGMOD Conference 1998
: 307-318
11
Piotr Indyk,
Rajeev Motwani
: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality.
STOC 1998
: 604-613
10
Tibor Hegedüs
, Piotr Indyk: On Learning Disjunctions of Zero-One Treshold Functions with Queries.
ALT 1997
: 446-460
9
Leszek Gasieniec
, Piotr Indyk,
Piotr Krysta
: External Inverse Pattern Matching.
CPM 1997
: 90-101
8
Leszek Gasieniec
, Piotr Indyk: Efficient Parallel Computing with Memory Faults.
FCT 1997
: 188-197
7
Yair Bartal
,
Moses Charikar
, Piotr Indyk: On Page Migration and Other Related Task Systems.
SODA 1997
: 43-52
6
Piotr Indyk,
Rajeev Motwani
,
Prabhakar Raghavan
,
Santosh Vempala
: Locality-Preserving Hashing in Multidimensional Spaces.
STOC 1997
: 618-625
5
Li Zhang
,
Harish Devarajan
,
Julien Basch
, Piotr Indyk: Probabilistic Analysis for Combinatorial Functions of Moving Points.
Symposium on Computational Geometry 1997
: 442-444
4
Bogdan S. Chlebus
,
Anna Gambin
, Piotr Indyk: Shared-Memory Simulations on a Faulty-Memory DMM.
ICALP 1996
: 586-597
3
Piotr Indyk: On Word-Level Parallelism in Fault-Tolerant Computing.
STACS 1996
: 193-204
2
Piotr Indyk: Optimal Simulation of Automata by Neural Nets.
STACS 1995
: 337-348
1
Bogdan S. Chlebus
,
Anna Gambin
, Piotr Indyk: PRAM Computations Resilient to Memory Faults.
ESA 1994
: 401-412
Copyright(C) 2000 ACM | | | | | | |
