Sciweavers

1963 search results - page 193 / 393
» The Maximum Solution Problem on Graphs
Sort
View
CORR
2006
Springer
127views Education» more  CORR 2006»
15 years 3 months ago
Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
Steven de Rooij, Paul M. B. Vitányi
IJKDB
2010
162views more  IJKDB 2010»
15 years 14 days ago
New Trends in Graph Mining: Structural and Node-Colored Network Motifs
Searching for repeated features characterizing biological data is fundamental in computational biology. When biological networks are under analysis, the presence of repeated modul...
Francesco Bruno, Luigi Palopoli, Simona E. Rombo
NIPS
2001
15 years 4 months ago
Matching Free Trees with Replicator Equations
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
Marcello Pelillo
EUROPAR
2009
Springer
15 years 9 months ago
Steady-State for Batches of Identical Task Trees
Abstract In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on stead...
Sékou Diakité, Loris Marchal, Jean-M...
APPROX
2004
Springer
120views Algorithms» more  APPROX 2004»
15 years 8 months ago
Simultaneous Source Location
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
Konstantin Andreev, Charles Garrod, Bruce M. Maggs...