2421 search results - page 324 / 485 » Approximate Flow-Aware Networking |
PET
2007
Springer
14 years 3 months ago
2007
Springer
We introduce a new traffic analysis attack: the Two-sided Statistical Disclosure Attack, that tries to uncover the receivers of messages sent through an anonymizing network support...
AAIM
2006
Springer
14 years 3 months ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
STOC
2006
ACM
14 years 3 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
ICANN
2005
Springer
14 years 3 months ago
2005
Springer
We describe a kernel method which uses the maximization of Onicescu’s informational energy as a criteria for computing the relevances of input features. This adaptive relevance d...
ICANN
2005
Springer
14 years 3 months ago
2005
Springer
While synaptic learning mechanisms have always been a core topic of neural computation research, there has been relatively little work on intrinsic learning processes, which change...