ICDE

2012

IEEE

11 years 9 months ago
2012

IEEE

—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...

COCO

2011

Springer

12 years 6 months ago
2011

Springer

Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...

APVIS

2011

12 years 6 months ago
2011

NETSPEAK helps writers in choosing words while writing a text. It checks for the commonness of phrases and allows for the retrieval of alternatives by means of wildcard queries. T...

ECCC

2010

13 years 1 months ago
2010

A k-query locally decodable code (LDC) C : n N encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordina...

CORR

2010

Springer

13 years 3 months ago
2010

Springer

: Given two testable properties P1 and P2, under what conditions are the union, intersection or set-difference of these two properties also testable? We initiate a systematic study...

BIBM

2010

IEEE

13 years 4 months ago
2010

IEEE

The emergence of data rich domains has led to an exponential growth in the size and number of data repositories, offering exciting opportunities to learn from the data using machin...

ECCC

2010

13 years 5 months ago
2010

We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...

CORR

2008

Springer

13 years 6 months ago
2008

Springer

We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...

APPROX

2008

Springer

13 years 8 months ago
2008

Springer

We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...

APPROX

2008

Springer

13 years 8 months ago
2008

Springer

We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...