Sciweavers

117 search results - page 23 / 24
» Polarity of chordal graphs
Sort
View
COCOON
2009
Springer
14 years 6 days ago
Convex Recoloring Revisited: Complexity and Exact Algorithms
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
Iyad A. Kanj, Dieter Kratsch
ECCC
2006
145views more  ECCC 2006»
13 years 5 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
TIP
2008
133views more  TIP 2008»
13 years 5 months ago
A Recursive Model-Reduction Method for Approximate Inference in Gaussian Markov Random Fields
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...
Jason K. Johnson, Alan S. Willsky
ICDM
2008
IEEE
136views Data Mining» more  ICDM 2008»
14 years 2 days ago
Document-Word Co-regularization for Semi-supervised Sentiment Analysis
The goal of sentiment prediction is to automatically identify whether a given piece of text expresses positive or negative opinion towards a topic of interest. One can pose sentim...
Vikas Sindhwani, Prem Melville
SCIENTOMETRICS
2010
131views more  SCIENTOMETRICS 2010»
13 years 12 days ago
Academic team formation as evolving hypergraphs
This paper quantitatively explores the social and socio-semantic patterns of constitution of academic collaboration teams. To this end, we broadly underline two critical features ...
Carla Taramasco, Jean-Philippe Cointet, Camille Ro...