Sciweavers

3415 search results - page 555 / 683
» Lower Bounds for Kernelizations
Sort
View
ICLP
1997
Springer
15 years 8 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
ISSAC
1997
Springer
157views Mathematics» more  ISSAC 1997»
15 years 8 months ago
On the Worst-case Complexity of Integer Gaussian Elimination
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
Xin Gui Fang, George Havas
NN
1997
Springer
174views Neural Networks» more  NN 1997»
15 years 8 months ago
Learning Dynamic Bayesian Networks
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
Zoubin Ghahramani
VLDB
1997
ACM
66views Database» more  VLDB 1997»
15 years 8 months ago
A One-Pass Algorithm for Accurately Estimating Quantiles for Disk-Resident Data
The cpquantile of an ordered sequenceof data values is the element with rank ‘pn, where n is the total number of values. Accurate estimates of quantiles are required for the sol...
Khaled Alsabti, Sanjay Ranka, Vineet Singh
VLDB
1997
ACM
104views Database» more  VLDB 1997»
15 years 8 months ago
A Generic Approach to Bulk Loading Multidimensional Index Structures
Abstract: Recently there has been an increasing interest in supporting bulk operations on multidimensional index structures. Bulk loading refers to the process of creating an initi...
Jochen Van den Bercken, Bernhard Seeger, Peter Wid...