239 search results - page 27 / 48 » A Simple Algorithm for Computing the Lempel Ziv Factorizatio... |
JCDL
2004
ACM
14 years 25 days ago
2004
ACM
Concept maps (CM) are informal, semantic, node-link conceptual graphs used to represent knowledge in a variety of applications. Algorithms that compare concept maps would be usefu...
TSP
2008
13 years 7 months ago
2008
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
ACIVS
2006
Springer
14 years 1 months ago
2006
Springer
When magnifying a bitmapped image, we want to increase the number of pixels it covers, allowing for finer details in the image, which are not visible in the original image. Simple...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We analyze the structure and evolution of discussion cascades in four popular websites: Slashdot, Barrapunto, Meneame and Wikipedia. Despite the big heterogeneities between these ...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...