Sciweavers

2314 search results - page 139 / 463
» Minimal Partitions of a Graph
Sort
View
EPEW
2005
Springer
15 years 9 months ago
Hypergraph Partitioning for Faster Parallel PageRank Computation
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
Jeremy T. Bradley, Douglas V. de Jager, William J....
ICIAR
2007
Springer
15 years 10 months ago
Landmark-Based Non-rigid Registration Via Graph Cuts
Abstract. This paper presents an approach based on graph cuts initially used for motion segmentation that is being applied to the nonrigid registration problem. The main contributi...
Herve Lombaert, Yiyong Sun, Farida Cheriet
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
15 years 5 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
BMCBI
2010
178views more  BMCBI 2010»
15 years 3 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
KDD
2007
ACM
186views Data Mining» more  KDD 2007»
16 years 4 months ago
Content-based document routing and index partitioning for scalable similarity-based searches in a large corpus
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
Deepavali Bhagwat, Kave Eshghi, Pankaj Mehra