2466 search results - page 283 / 494 » Algorithms for distributed functional monitoring |
134
Voted
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
127
Voted
INFOSCALE
2006
ACM
15 years 8 months ago
2006
ACM
A fundamental paradigm in P2P is that of a large community of intermittently-connected nodes that cooperate to share files. Because nodes are intermittently connected, the P2P co...
127
Voted
SIGCOMM
2003
ACM
15 years 8 months ago
2003
ACM
This paper presents an algorithm for content-based forwarding, an essential function in content-based networking. Unlike in traditional address-based unicast or multicast networks...
127
click to vote
ISBI
2006
IEEE
16 years 3 months ago
2006
IEEE
We present a physical phantom designed for fibre tractography validation and use it to evaluate tracking algorithms that employ (a) the classic diffusion tensor model of diffusion...
156
Voted
IPPS
2009
IEEE
15 years 9 months ago
2009
IEEE
—We present an application programming interface (API) for the C programming language that facilitates the development of dense linear algebra algorithms on graphics processors a...