11371 search results - page 2144 / 2275 » The network inhibition problem |
207
click to vote
MM
2004
ACM
15 years 11 months ago
2004
ACM
We consider the problem of learning a mapping function from low-level feature space to high-level semantic space. Under the assumption that the data lie on a submanifold embedded ...
184
click to vote
SIGCOMM
2004
ACM
15 years 11 months ago
2004
ACM
While application end-point architectures have proven to be viable solutions for large-scale distributed applications such as distributed computing and file-sharing, there is lit...
182
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
196
click to vote
ADHOCNOW
2004
Springer
15 years 11 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
161
click to vote
CCS
2004
ACM
15 years 11 months ago
2004
ACM
Payload attribution is an important problem often encountered in network forensics. Given an excerpt of a payload, finding its source and destination is useful for many security ...