260 search results - page 30 / 52 » Resolution Complexity of Independent Sets in Random Graphs |
142
Voted
COMPLEX
2009
Springer
15 years 10 months ago
2009
Springer
We derive variational equations to analyze the stability of synchronization for coupled near-identical oscillators. To study the effect of parameter mismatch on the stability in a ...
147
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
161
click to vote
KDD
2010
ACM
15 years 7 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
135
click to vote
SIAMDM
2008
15 years 3 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
129
click to vote
BIOINFORMATICS
2005
15 years 3 months ago
2005
Motivation: direct bearing whose expres Sorlie et al., 2 gene sets is a diseases (Lossos et al., 2004; Miklos and Maleszka, 2004), and the variables that could account questions i...