Sciweavers

1322 search results - page 72 / 265
» Parameterized counting problems
Sort
View
CJ
2010
150views more  CJ 2010»
13 years 6 months ago
Program Analysis Probably Counts
Abstract. Semantics-based program analysis uses an abstract semantics of programs/systems to statically determine run-time properties. Classic examples from compiler technology inc...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
ICML
2002
IEEE
14 years 9 months ago
Active + Semi-supervised Learning = Robust Multi-View Learning
In a multi-view problem, the features of the domain can be partitioned into disjoint subsets (views) that are sufficient to learn the target concept. Semi-supervised, multi-view a...
Ion Muslea, Steven Minton, Craig A. Knoblock
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 5 months ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...
SIAMSC
2010
231views more  SIAMSC 2010»
13 years 7 months ago
Optimal Control of Parameter-Dependent Convection-Diffusion Problems around Rigid Bodies
Abstract. This paper is concerned with optimal control problems of partial differential equations. In particular, parameterized convection-diffusion problems are considered, wher...
Timo Tonn, Karsten Urban, Stefan Volkwein
COMPGEOM
2009
ACM
14 years 3 months ago
A general approach for cache-oblivious range reporting and approximate range counting
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh