Sciweavers

10301 search results - page 1720 / 2061
» informs 2007
Sort
View
WADS
2007
Springer
140views Algorithms» more  WADS 2007»
16 years 28 days ago
A Stab at Approximating Minimum Subadditive Join
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
Staal A. Vinterbo
WAOA
2007
Springer
158views Algorithms» more  WAOA 2007»
16 years 28 days ago
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
Anke van Zuylen, David P. Williamson
WAPCV
2007
Springer
16 years 28 days ago
An Experimental Comparison of Three Guiding Principles for the Detection of Salient Image Locations: Stability, Complexity, and
We present an experimental comparison of the performance of representative saliency detectors from three guiding principles for the detection of salient image locations: locations...
Dashan Gao, Nuno Vasconcelos
WAW
2007
Springer
91views Algorithms» more  WAW 2007»
16 years 28 days ago
Determining Factors Behind the PageRank Log-Log Plot
Abstract. We study the relation between PageRank and other parameters of information networks such as in-degree, out-degree, and the fraction of dangling nodes. We model this relat...
Yana Volkovich, Nelly Litvak, Debora Donato
WDAG
2007
Springer
82views Algorithms» more  WDAG 2007»
16 years 28 days ago
The Space Complexity of Unbounded Timestamps
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
Faith Ellen, Panagiota Fatourou, Eric Ruppert
« Prev « First page 1720 / 2061 Last » Next »