252 search results - page 20 / 51 » Decremental Clique Problem |
ISSS
1996
IEEE
15 years 1 months ago
1996
IEEE
In this paper we investigate the problem of code generation for address computation for DSP processors. This work is divided into four parts. First, we propose a branch instructio...
105
click to vote
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
BMCBI
2006
14 years 9 months ago
2006
Background: Modeling of cis-elements or regulatory motifs in promoter (upstream) regions of genes is a challenging computational problem. In this work, set of regulatory motifs si...
125
click to vote
CONEXT
2009
ACM
14 years 10 months ago
2009
ACM
Building on the popularity of online social networks (OSNs) such as Facebook, social content-sharing applications allow users to form communities around shared interests. Millions...
MST
2010
14 years 4 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...