Results 1 - 10 of 438

Clique Partitions, Graph Compression and Speeding-up Algorithms

by Tomás Feder, Rajeev Motwani - Journal of Computer and System Sciences , 1991
"... We first consider the problem of partitioning the edges of a graph G into bipartite cliques such that the total order of the cliques is minimized, where the order of a clique is the number of vertices in it. It is shown that the problem is NP-complete. We then prove the existence of a partition of s ..."
Abstract - Cited by 88 (3 self) - Add to MetaCart
on graph partitioning to efficiently compute an optimal compression for graphs of a given size. An interesting application of the graph compression result arises from the fact that several graph algorithms can be adapted to work with the compressed representation of the input graph, thereby improving

Improving the maximumweight clique algorithm for the dense graphs, The

by Deniss Kumlander - Proceedings of the 10th WSEAS International Conference on SYSTEMS Vouliagmeni
"... Abstract: In this paper we present a fast algorithm for the maximum-weight clique problem on arbitrary undirected graphs, which is improved for the dense graphs. The algorithm uses colour classes and backtracking techniques inside itself in parallel in a form of a branch and bound algorithm. The alg ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract: In this paper we present a fast algorithm for the maximum-weight clique problem on arbitrary undirected graphs, which is improved for the dense graphs. The algorithm uses colour classes and backtracking techniques inside itself in parallel in a form of a branch and bound algorithm

Efficient Belief Propagation for Higher Order Cliques Using Linear Constraint Nodes

by Brian Potetz, Tai Sing Lee , 2008
"... Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems. However, pairwise interactions are often insufficient to capture the full statistics of the problem. Higher-order intera ..."
Abstract - Cited by 8 (2 self) - Add to MetaCart
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems. However, pairwise interactions are often insufficient to capture the full statistics of the problem. Higher

Dynamic Programming and Clique Based Approaches for Protein Threading with Profiles and Constraints ∗

by Tatsuya Akutsu †a, Morihiro Hayashida, Dukka Bahadur K. C, Etsuji Tomita, Katsuhisa Horimoto , 2006
"... SUMMARY The protein threading problem with profiles is known to be efficiently solvable using dynamic programming. In this paper, we consider a variant of the protein threading problem with profiles in which constraints on distances between residues are given. We prove that protein threading with pr ..."
Abstract - Add to MetaCart
edgeweight clique problem, whereas BBDPTHREAD combines dynamic programming and branch-and-bound techniques. We perform computational experiments using protein structure data in PDB (Protein Data Bank) using simulated distance constraints. The results show that constraints are useful to improve the alignment

On the pricing of contingent claims under constraints

by I. Karatzas, S. G. Kou - Annals of Applied Probability , 1996
"... We discuss the problem of pricing contingent claims, such as European call-options, based on the fundamental principle of “absence of arbitrage ” and in the presence of constraints on portfolio choice, e.g. incomplete markets and markets with short-selling constraints. Under such constraints, we sho ..."
Abstract - Cited by 61 (3 self) - Add to MetaCart
of this interval are characterized in terms of auxiliary stochastic control problems, in the manner of Cvitanić & Karatzas (1993). These characterizations lead to explicit computations, or bounds, in several interesting cases. Furthermore, a unique fair price ˆp is selected inside this interval, based

Computationally Bounded Retrieval

by Mohammad Rastegari , Cem Keskin , Pushmeet Kohli , Shahram Izadi
"... Abstract The increase in size of large image databases makes the problem of efficient retrieval extremely challenging. This is especially true in the case of high dimensional data where even operations like hashing become expensive because of costly projection operators. Unlike most hashing methods ..."
Abstract - Add to MetaCart
methods that sacrifice accuracy for speed, we propose a novel method that improves the speed of high dimensional image retrieval by several orders of magnitude without any significant drop in performance. To do this, we propose to learn computationally bounded sparse projections for the encoding step

Efficient belief propagation for vision using linear constraint nodes

by Brian Potetz - in CVPR , 2007
"... Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems. However, pairwise interactions are often insufficient to capture the full statistics of the problem. Higher-order intera ..."
Abstract - Cited by 39 (7 self) - Add to MetaCart
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems. However, pairwise interactions are often insufficient to capture the full statistics of the problem. Higher

Improved recombination lower bounds for haplotype data

by Vineet Bafna , Vikas Bansal - In Proc. 9th Annual Intl. Conf. on Research in Computational Molecular Biology (RECOMB , 2005
"... Abstract. Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understanding the fine scale variation in recombination rates across the human genome using DNA polymorphism data. A com ..."
Abstract - Cited by 13 (0 self) - Add to MetaCart
for computing a diversity based bound Rg. This algorithm is several orders of magnitude faster than the Recmin program [1] and the bound Rg matches the bound R h almost always. -We also show that computing the lower bound Rs is also NP-hard using a reduction from MAX-2SAT. We give a O(m2 n ) time algorithm

Treewidth: Computational experiments

by Arie M. C. A. Koster, Hans L. Bodlaender, Stan P. M. Van Hoesel , 2001
"... Many NP-complete graph problems can be solved in polynomial time for graphs with bounded treewidth. Equivalent results are known for pathwidth and branchwidth. In recent years, several studies have shown that this result is not only of theoretical interest but can successfully be applied to nd (almo ..."
Abstract - Cited by 45 (9 self) - Add to MetaCart
are based on well-known algorithms to recognize triangulated graphs. The fourth heuristic recursively improves a tree decomposition by the computation of minimal separating vertex sets in subgraphs. Lower bounds can be computed from maximal cliques and the minimum degree of induced subgraphs. A

A new algorithm for optimal constraint satisfaction and its implications

by Ryan Williams - Alexander D. Scott) Mathematical Institute, University of Oxford , 2004
"... We present a novel method for exactly solving (in fact, counting solutions to) general constraint satisfaction optimization with at most two variables per constraint (e.g. MAX-2-CSP and MIN-2-CSP), which gives the first exponential improvement over the trivial algorithm; more precisely, it is a cons ..."
Abstract - Cited by 38 (1 self) - Add to MetaCart
We present a novel method for exactly solving (in fact, counting solutions to) general constraint satisfaction optimization with at most two variables per constraint (e.g. MAX-2-CSP and MIN-2-CSP), which gives the first exponential improvement over the trivial algorithm; more precisely, it is a
Results 1 - 10 of 438