Sciweavers

1816 search results - page 30 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
ICML
2004
IEEE
16 years 19 days ago
Solving cluster ensemble problems by bipartite graph partitioning
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
Xiaoli Zhang Fern, Carla E. Brodley
SIAMDM
2008
90views more  SIAMDM 2008»
14 years 11 months ago
Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The pre...
Andrei A. Krokhin, Benoit Larose
CONSTRAINTS
2010
110views more  CONSTRAINTS 2010»
14 years 9 months ago
Solving subgraph isomorphism problems with constraint programming
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
Stéphane Zampelli, Yves Deville, Christine ...
UAI
2004
15 years 1 months ago
Maximum Entropy for Collaborative Filtering
Within the task of collaborative filtering two challenges for computing conditional probabilities exist. First, the amount of training data available is typically sparse with resp...
C. Lawrence Zitnick, Takeo Kanade
EMNLP
2006
15 years 1 months ago
Semantic Role Labeling of NomBank: A Maximum Entropy Approach
This paper describes our attempt at NomBank-based automatic Semantic Role Labeling (SRL). NomBank is a project at New York University to annotate the argument structures for commo...
Zheng Ping Jiang, Hwee Tou Ng