1322 search results - page 207 / 265 » Parameterized counting problems |
145
Voted
NIPS
2003
15 years 5 months ago
2003
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
128
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
120
click to vote
SIAMAM
2008
15 years 3 months ago
2008
This paper generalizes well-established derivations of the radiative transfer equation from first principles to model the energy density of time-dependent and monochromatic high f...
110
Voted
SIGMETRICS
2008
ACM
15 years 3 months ago
2008
ACM
Control of large distributed cloud-based services is a challenging problem. The Distributed Rate Limiting (DRL) paradigm was recently proposed as a mechanism for tackling this pro...
167
Voted
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...