3267 search results - page 166 / 654 » Generalized quasirandom graphs |
163
click to vote
JCO
2010
15 years 5 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
201
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
176
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
249
click to vote
ICDE
2002
IEEE
16 years 8 months ago
2002
IEEE
This paper explores the aggregate effect when caching multiple versions of the same Web object in the transcoding proxy. Explicitly, the aggregate profit from caching multiple ver...
183
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
Automatic categorization of user queries is an important component of general purpose (Web) search engines, particularly for triggering rich, query-specific content and sponsored ...