Sciweavers

176 search results - page 8 / 36
» A Problem Kernelization for Graph Packing
Sort
View
RECOMB
2004
Springer
14 years 7 months ago
Mining protein family specific residue packing patterns from protein structure graphs
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
Jun Huan, Wei Wang 0010, Deepak Bandyopadhyay, Jac...
ESA
2009
Springer
131views Algorithms» more  ESA 2009»
14 years 2 months ago
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
Geevarghese Philip, Venkatesh Raman, Somnath Sikda...
IPMU
2010
Springer
13 years 9 months ago
The Link Prediction Problem in Bipartite Networks
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
Jérôme Kunegis, Ernesto William De Lu...
IJCV
2007
208views more  IJCV 2007»
13 years 7 months ago
Binet-Cauchy Kernels on Dynamical Systems and its Application to the Analysis of Dynamic Scenes
We derive a family of kernels on dynamical systems by applying the Binet-Cauchy theorem to trajectories of states. Our derivation provides a unifying framework for all kernels on d...
S. V. N. Vishwanathan, Alexander J. Smola, Ren&eac...
IPCO
2010
184views Optimization» more  IPCO 2010»
13 years 9 months ago
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
Takuro Fukunaga