71 search results - page 6 / 15 » Kernelizations for Parameterized Counting Problems |
ACID
2006
13 years 9 months ago
2006
The r-Regular Induced Subgraph problem asks, given a graph G and a nonnegative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced ...
ALGORITHMICA
2008
13 years 7 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
IJCAI
2007
13 years 9 months ago
2007
Kernel based nonlinear Feature Extraction (KFE) or dimensionality reduction is a widely used pre-processing step in pattern classification and data mining tasks. Given a positive...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—Target counting in sensor-based surveillance systems is an interesting task that potentially could have many important applications in practice. In such a system, each sensor ou...
COLT
2003
Springer
14 years 22 days ago
2003
Springer
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ...