Sciweavers

2880 search results - page 251 / 576
» Approximate Range Searching
Sort
View
126
Voted
HYBRID
2007
Springer
15 years 7 months ago
Qualitative Analysis of Nonlinear Biochemical Networks with Piecewise-Affine Functions
Abstract. Nonlinearities and the lack of accurate quantitative information considerably hamper modeling and system analysis of biochemical networks. Here we propose a procedure for...
M. W. J. M. Musters, Hidde de Jong, P. P. J. van d...
ICML
2010
IEEE
15 years 5 months ago
Sequential Projection Learning for Hashing with Compact Codes
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
Jun Wang, Sanjiv Kumar, Shih-Fu Chang
132
Voted
DCG
2010
137views more  DCG 2010»
15 years 4 months ago
Improved Results on Geometric Hitting Set Problems
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray
ECCC
2010
78views more  ECCC 2010»
15 years 4 months ago
PCPs and the Hardness of Generating Synthetic Data
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...
Jonathan Ullman, Salil P. Vadhan
JDA
2007
73views more  JDA 2007»
15 years 3 months ago
Parameterized matching with mismatches
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
Alberto Apostolico, Péter L. Erdös, Mo...