17 search results - page 3 / 4 » Improving the Performance of M-Tree Family by Nearest-Neighb... |
PVLDB
2010
13 years 4 months ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
SIGMETRICS
2000
ACM
13 years 5 months ago
2000
ACM
Quality of service of e-commerce sites has been usually managed by the allocation of resources such as processors, disks, and network bandwidth, and by tracking conventional perfo...
CISS
2008
IEEE
14 years 8 days ago
2008
IEEE
Abstract – In this paper, a variational message passing framework is proposed for Markov random fields. Analogous to the traditional belief propagation algorithm, variational mes...
STOC
2005
ACM
14 years 6 months ago
2005
ACM
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
INFOCOM
2009
IEEE
14 years 13 days ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...