Sciweavers

185 search results - page 10 / 37
» Property Testing with Geometric Queries
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
Dispersion of Mass and the Complexity of Randomized Geometric Algorithms
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
Luis Rademacher, Santosh Vempala
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
13 years 11 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira
RSA
2002
51views more  RSA 2002»
13 years 7 months ago
Testing subgraphs in large graphs
Let H be a fixed graph with h vertices, let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. It is known that in this ca...
Noga Alon
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
13 years 7 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
FOCS
2009
IEEE
14 years 2 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...