44 search results - page 9 / 9 » On Optimal Node Splitting for R-trees |
COMCOM
2008
13 years 5 months ago
2008
In this paper, we study using game theory the problem of detecting intrusions in wired infrastructure networks. Detection is accomplished by sampling a subset of the transmitted p...
CVPR
2009
IEEE
15 years 1 months ago
2009
IEEE
Belief propagation (BP) is an effective algorithm for solving energy minimization problems in computer vision. However, it requires enormous memory, bandwidth, and computation beca...
EUROPAR
2009
Springer
13 years 10 months ago
2009
Springer
Data access in HPC infrastructures is realized via user-level networking and OS-bypass techniques through which nodes can communicate with high bandwidth and low-latency. Virtualiz...
ACL
2003
13 years 7 months ago
2003
We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down fa...