Sciweavers

2969 search results - page 557 / 594
» A space efficient algorithm for group structure computation
Sort
View
BMCBI
2010
151views more  BMCBI 2010»
15 years 3 months ago
Misty Mountain clustering: application to fast unsupervised flow cytometry gating
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
István P. Sugár, Stuart C. Sealfon
DAC
2003
ACM
16 years 4 months ago
Multilevel floorplanning/placement for large-scale modules using B*-trees
We present in this paper a multilevel floorplanning/placement framework based on the B*-tree representation, called MB*-tree, to handle the floorplanning and packing for large-sca...
Hsun-Cheng Lee, Yao-Wen Chang, Jer-Ming Hsu, Hanna...
WWW
2008
ACM
16 years 3 months ago
Trust-based recommendation systems: an axiomatic approach
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
CVPR
2007
IEEE
16 years 5 months ago
Layered Graph Match with Graph Editing
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
Liang Lin, Song Chun Zhu, Yongtian Wang
ESA
2004
Springer
129views Algorithms» more  ESA 2004»
15 years 8 months ago
Contraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...