14 search results - page 2 / 3 » Approximation Resistant Predicates from Pairwise Independenc... |
SAGA
2007
Springer
13 years 11 months ago
2007
Springer
In the layered-graph query model of network discovery, a query at a node v of an undirected graph G discovers all edges and non-edges whose endpoints have different distance from ...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
TCAD
1998
13 years 4 months ago
1998
—This paper addresses, from a probabilistic point of view, the issue of switching activity estimation in combinational circuits under the zero-delay model. As the main theoretica...
TCIAIG
2010
12 years 12 months ago
2010
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
ICDE
2002
IEEE
14 years 6 months ago
2002
IEEE
We propose a novel approach to shape-based image retrieval that builds upon a similarity criterion which is based on the average point set distance. Compared to traditional techni...