Sciweavers

1078 search results - page 205 / 216
» Networks with Small Stretch Number
Sort
View
GLOBECOM
2009
IEEE
13 years 11 months ago
Compressed Sensing Reception of Bursty UWB Impulse Radio is Robust to Narrow-Band Interference
—We have recently proposed a novel receiver for Ultra-Wide-band Impulse-Radio communication in bursty applications like Wireless Sensor Networks. The receiver, based on the princ...
Anand Oka, Lutz H.-J. Lampe
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 9 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
NECO
2007
127views more  NECO 2007»
13 years 8 months ago
Visual Recognition and Inference Using Dynamic Overcomplete Sparse Learning
We present a hierarchical architecture and learning algorithm for visual recognition and other visual inference tasks such as imagination, reconstruction of occluded images, and e...
Joseph F. Murray, Kenneth Kreutz-Delgado
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 7 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
12 years 11 months ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
Dan Boneh, David Mandell Freeman