135 search results - page 27 / 27 » Hardness of cut problems in directed graphs |
MM
2009
ACM
13 years 10 months ago
2009
ACM
Following the exponential growth of social media, there now exist huge repositories of videos online. Among the huge volumes of videos, there exist large numbers of near-duplicate...
SIGSOFT
2002
ACM
14 years 6 months ago
2002
ACM
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
GECCO
2009
Springer
14 years 6 days ago
2009
Springer
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ...
PODC
2012
ACM
11 years 8 months ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...