Sciweavers

315 search results - page 14 / 63
» Better Approximation of Betweenness Centrality
Sort
View
APPROX
2000
Springer
190views Algorithms» more  APPROX 2000»
13 years 11 months ago
Approximating node connectivity problems via set covers
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
Guy Kortsarz, Zeev Nutov
DATE
2002
IEEE
87views Hardware» more  DATE 2002»
14 years 13 days ago
Model Reduction in the Time-Domain Using Laguerre Polynomials and Krylov Methods
We present a new passive model reduction algorithm based on the Laguerre expansion of the time response of interconnect networks. We derive expressions for the Laguerre coefficie...
Yiran Chen, Venkataramanan Balakrishnan, Cheng-Kok...
IACR
2011
123views more  IACR 2011»
12 years 7 months ago
Hummingbird: Privacy at the time of Twitter
In the last several years, micro-blogging Online Social Networks (OSNs), such as Twitter, have taken the world by storm, now boasting over 100 million subscribers. As an unparalle...
Emiliano De Cristofaro, Claudio Soriente, Gene Tsu...
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
14 years 1 months ago
The Quality vs. Time Trade-off for Approximate Image Descriptor Search
In recent years, content-based image retrieval has become more and more important in many application areas. Similarity retrieval is inherently a very demanding process, in partic...
Rut Siguroardottir, Björn Þór J&...
CRYPTO
2009
Springer
154views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
Vadim Lyubashevsky, Daniele Micciancio