13214 search results - page 340 / 2643 » Pseudorandomness for network algorithms |
227
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
Image denoising can be described as the problem of mapping from a noisy image to a noise-free image. The best currently available denoising methods approximate this mapping with c...
174
click to vote
NIPS
2003
15 years 8 months ago
2003
Most proposals for quantum neural networks have skipped over the problem of how to train the networks. The mechanics of quantum computing are different enough from classical compu...
176
Voted
ALGORITHMICA
2006
15 years 6 months ago
2006
We present some fundamental structural properties for minimum length networks (known as Steiner minimum trees) interconnecting a given set of points in an environment in which edg...
192
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
250
click to vote
ANCS
2009
ACM
15 years 4 months ago
2009
ACM
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...