Sciweavers

57 search results - page 7 / 12
» A new approach to the planted clique problem
Sort
View
NIPS
2004
13 years 8 months ago
Efficient Out-of-Sample Extension of Dominant-Set Clusters
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
Massimiliano Pavan, Marcello Pelillo
CSB
2005
IEEE
152views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Consensus Genetic Maps: A Graph Theoretic Approach
A genetic map is an ordering of genetic markers constructed from genetic linkage data for use in linkage studies and experimental design. While traditional methods have focused on...
Benjamin G. Jackson, Srinivas Aluru, Patrick S. Sc...
NIPS
2007
13 years 9 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
WSC
1997
13 years 8 months ago
Simulation of Bulk Flow and High Speed Operations
Simulation modeling can be highly effective for solving problems found in the food, beverage, consumer products, and pharmaceutical industries. The flow of material or fluid in th...
Andrew J. Siprelle, Richard A. Phelps
BMCBI
2006
141views more  BMCBI 2006»
13 years 7 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings