Sciweavers

2463 search results - page 245 / 493
» Rankings of Directed Graphs
Sort
View
IANDC
2007
123views more  IANDC 2007»
15 years 3 months ago
Hardness of fully dense problems
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
Nir Ailon, Noga Alon
IEICET
2010
92views more  IEICET 2010»
15 years 2 months ago
Spectral Methods for Thesaurus Construction
Traditionally, popular synonym acquisition methods are based on the distributional hypothesis, and a metric such as Jaccard coefficients is used to evaluate the similarity between...
Nobuyuki Shimizu, Masashi Sugiyama, Hiroshi Nakaga...
WAW
2010
Springer
312views Algorithms» more  WAW 2010»
15 years 1 months ago
The Geometric Protean Model for On-Line Social Networks
We introduce a new geometric, rank-based model for the link structure of on-line social networks (OSNs). In the geo-protean (GEO-P) model for OSNs nodes are identified with points ...
Anthony Bonato, Jeannette Janssen, Pawel Pralat
SIAMJO
2010
110views more  SIAMJO 2010»
14 years 10 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng
197
Voted
PPOPP
2010
ACM
16 years 1 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...