990 search results - page 189 / 198 » Sub-Graphs of Complete Graph |
WABI
2009
Springer
14 years 2 months ago
2009
Springer
Background: Frameshift mutations in protein-coding DNA sequences produce a drastic change in the resulting protein sequence, which prevents classic protein alignment methods from ...
WADS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
RECSYS
2009
ACM
14 years 2 months ago
2009
ACM
Tagging systems have become major infrastructures on the Web. They allow users to create tags that annotate and categorize content and share them with other users, very helpful in...
CGO
2008
IEEE
14 years 1 months ago
2008
IEEE
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
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...