9842 search results - page 428 / 1969 » The Complexity of the Matching-Cut Problem |
155
click to vote
MST
2011
14 years 11 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
137
click to vote
JMLR
2010
14 years 11 months ago
2010
Networks are becoming a unifying framework for modeling complex systems and network inference problems are frequently encountered in many fields. Here, I develop and apply a gener...
132
Voted
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
The problem of estimation of the slowly-varying instantaneous frequency of a nonstationary complex sinusoidal signal buried in noise is considered. This problem is usually solved ...
149
click to vote
ECCC
2011
14 years 8 months ago
2011
We show that two complexity classes introduced about two decades ago are equal. ReachUL is the class of problems decided by nondeterministic log-space machines which on every inpu...
180
click to vote
FOGA
2011
14 years 8 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...