2698 search results - page 436 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
ICML
2006
IEEE
14 years 10 months ago
2006
IEEE
In machine learning problems with tens of thousands of features and only dozens or hundreds of independent training examples, dimensionality reduction is essential for good learni...
CC
2007
Springer
13 years 9 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
WIA
2009
Springer
14 years 3 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
WAIM
2007
Springer
14 years 3 months ago
2007
Springer
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
COMCOM
2004
13 years 9 months ago
2004
In multihop wavelength division multiplexing systems, a connection between two communication nodes consists of one or more lightpaths. A wavelength conversion is required at the j...