Sciweavers

709 search results - page 75 / 142
» On LR(k)-Parsers of Polynomial Size
Sort
View
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
14 years 9 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
STACS
2012
Springer
13 years 5 months ago
Stabilization of Branching Queueing Networks
Queueing networks are gaining attraction for the performance analysis of parallel computer systems. A Jackson network is a set of interconnected servers, where the completion of a...
Tomás Brázdil, Stefan Kiefer
CORR
2011
Springer
158views Education» more  CORR 2011»
14 years 4 months ago
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
Michael Burr, Felix Krahmer
ICDT
2011
ACM
242views Database» more  ICDT 2011»
14 years 1 months ago
Knowledge compilation meets database theory: compiling queries to decision diagrams
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
Abhay Kumar Jha, Dan Suciu
ICIP
1997
IEEE
15 years 11 months ago
Two-Dimensional Blind Deconvolution Using a Robust GCD Approach
In this paper we examine the applicability of the previously proposed Greatest Common Divisor (GCD) method to blind image deconvolution. In this method, the desired image is appro...
S. U. Pillai, B. Liang