Sciweavers

16404 search results - page 274 / 3281
» A set coverage problem
Sort
View
ADBIS
1995
Springer
130views Database» more  ADBIS 1995»
15 years 8 months ago
Magic Sets vs. SLD-Resolution
It is by now folklore that the bottom-up evaluation of a program after the “magic set” transformation is “as efficient as” top-down evaluation. There are a number of forma...
Stefan Brass
STACS
2000
Springer
15 years 8 months ago
Almost Complete Sets
We show that there is a set that is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2lin ...
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, S...
WSCG
2003
165views more  WSCG 2003»
15 years 5 months ago
High Dynamic Range Image Display Using Level Set Framework
This paper presents a novel solution to the High Dynamic Range (HDR) image compression problem using level set framework. Using level set framework, this method separates the HDR ...
R. Xu, Sumanta N. Pattanaik
JMLR
2006
89views more  JMLR 2006»
15 years 4 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
MCSS
2006
Springer
15 years 4 months ago
Optimal input sets for time minimality in quantized control systems
Abstract Limited capacity of communication channels has brought to the attention of many researchers the analysis of control systems subject to a quantized input set. In some funda...
Alessia Marigo