359 search results - page 23 / 72 » Online Algorithms for Disk Graphs |
102
click to vote
BMCBI
2010
14 years 11 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
We present a methodology for enhancing the delivery of usergenerated content in online social networks. To this end, we first regularize the social graph via node capacity and li...
103
click to vote
PKDD
2010
Springer
14 years 9 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
140
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
102
click to vote
SIROCCO
2001
15 years 1 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...