Sciweavers

1951 search results - page 96 / 391
» An algorithm for improving graph partitions
Sort
View
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
15 years 5 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
BROADNETS
2006
IEEE
15 years 10 months ago
Design and Dimensioning of a Novel composite-star WDM Network with TDM Channel Partitioning
— This paper presents the design and dimensioning optimization of a novel optical network structure, called the Petaweb, having a total capacity of several Pb/s (1015 bit/s). Its...
Stefano Secci, Brunilde Sansò
ICIP
2007
IEEE
16 years 6 months ago
Domain-Partitioning Rankboost for Face Recognition
In this paper we propose a domain partitioning RankBoost approach for face recognition. This method uses Local Gabor Binary Pattern Histogram (LGBPH) features for face representat...
Bangpeng Yao, Haizhou Ai, Yoshihisa Ijiri, Shihong...
EPEW
2005
Springer
15 years 10 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....
TKDE
1998
163views more  TKDE 1998»
15 years 4 months ago
A Highly Effective Partition Selection Policy for Object Database Garbage Collection
—We investigate methods to improve the performance of algorithms for automatic storage reclamation of object databases. These algorithms are based on a technique called partition...
Jonathan E. Cook, Alexander L. Wolf, Benjamin G. Z...