Sciweavers

503 search results - page 66 / 101
» Two Algorithms for the Minimum Enclosing Ball Problem
Sort
View
PKDD
2009
Springer
134views Data Mining» more  PKDD 2009»
16 years 1 months ago
Mining Graph Evolution Rules
In this paper we introduce graph-evolution rules, a novel type of frequency-based pattern that describe the evolution of large networks over time, at a local level. Given a sequenc...
Michele Berlingerio, Francesco Bonchi, Björn ...
IANDC
2010
67views more  IANDC 2010»
15 years 5 months ago
Parameterized computational complexity of Dodgson and Young elections
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
Nadja Betzler, Jiong Guo, Rolf Niedermeier
COMPGEOM
2006
ACM
16 years 13 days ago
Embedding ultrametrics into low-dimensional spaces
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
COMCOM
2006
96views more  COMCOM 2006»
15 years 6 months ago
Dynamic cache reconfiguration strategies for cluster-based streaming proxy
The high bandwidth and the relatively long-lived characteristics of digital video are key limiting factors in the wide-spread usage of streaming content over the Internet. The pro...
Yang Guo, Zihui Ge, Bhuvan Urgaonkar, Prashant J. ...
IPPS
2000
IEEE
15 years 11 months ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen