4137 search results - page 798 / 828 » On the number of matchings of a tree |
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
156
Voted
MM
2009
ACM
15 years 6 months ago
2009
ACM
Following the exponential growth of social media, there now exist huge repositories of videos online. Among the huge volumes of videos, there exist large numbers of near-duplicate...
122
click to vote
PKC
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...
122
click to vote
WDAG
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
116
click to vote
DAWAK
2001
Springer
15 years 6 months ago
2001
Springer
Data mining has been defined as the non- trivial extraction of implicit, previously unknown and potentially useful information from data. Association mining is one of the important...