5647 search results - page 341 / 1130 » A word from the editor |
197
click to vote
SCL
2008
15 years 6 months ago
2008
ABSTRACT: Linear function approximations based on random projections are proposed and justified for a class of fixed point and minimization problems. KEY WORDS: random projections,...
170
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
166
click to vote
IPL
2007
15 years 6 months ago
2007
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a pr...
192
Voted
TOIS
2008
15 years 6 months ago
2008
Many valuable text databases on the web have non-crawlable contents that are "hidden" behind search interfaces. Metasearchers are helpful tools for searching over multip...
182
click to vote
DAM
2002
15 years 6 months ago
2002
It is proved that seven different approaches to the multi-peg Tower of Hanoi problem are all equivalent. Among them the classical approaches of Stewart and Frame from 1941 can be ...