3247 search results - page 444 / 650 » Randomized smoothing networks |
160
click to vote
IJCNN
2006
IEEE
16 years 1 months ago
2006
IEEE
—In this paper we propose a new graph-based feature splitting algorithm maxInd, which creates a balanced split maximizing the independence between the two feature sets. We study ...
197
Voted
P2P
2006
IEEE
16 years 1 months ago
2006
IEEE
Peer discovery and route set-up are an integral part of the processes by which anonymizing peer-to-peer systems are made secure. When systems are large, and individual nodes only ...
178
Voted
SIGMETRICS
2006
ACM
16 years 1 months ago
2006
ACM
The Erlang formula is known to be insensitive to the holding time distribution beyond the mean. While calls are generally assumed to arrive as a Poisson process, we prove that it ...
192
click to vote
STOC
2006
ACM
16 years 1 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...
185
click to vote
ICANN
2005
Springer
16 years 18 days ago
2005
Springer
We explore the use of eye movements as a source of implicit relevance feedback information. We construct a controlled information retrieval experiment where the relevance of each t...