5005 search results - page 452 / 1001 » The Design and Analysis of Parallel Algorithms |
183
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
175
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
176
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We propose a novel approach to designing algorithms for
object tracking based on fusing multiple observation models.
As the space of possible observation models is too large
for...
168
click to vote
MIDDLEWARE
2005
Springer
16 years 9 days ago
2005
Springer
This paper introduces dual-quorum replication, a novel data replication algorithm designed to support Internet edge services. Dual-quorum replication combines volume leases and qu...
205
click to vote
STACS
2007
Springer
16 years 28 days ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...