Sciweavers

1322 search results - page 207 / 265
» Parameterized counting problems
Sort
View
NIPS
2003
14 years 16 days ago
Minimax Embeddings
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...
Matthew Brand
FOCS
2006
IEEE
14 years 5 months ago
On the Compressibility of NP Instances and Cryptographic Applications
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...
Danny Harnik, Moni Naor
SIAMAM
2008
79views more  SIAMAM 2008»
13 years 11 months ago
Transport-Based Imaging in Random Media
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...
Guillaume Bal, Kui Ren
SIGMETRICS
2008
ACM
106views Hardware» more  SIGMETRICS 2008»
13 years 11 months ago
Fully decentralized emulation of best-effort and processor sharing queues
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...
Rade Stanojevic, Robert Shorten
FSTTCS
2010
Springer
13 years 9 months ago
The effect of girth on the kernelization complexity of Connected Dominating Set
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...
Neeldhara Misra, Geevarghese Philip, Venkatesh Ram...