8437 search results - page 606 / 1688 » Preferences over Sets |
178
click to vote
VLDB
1997
ACM
15 years 11 months ago
1997
ACM
In this paper we describe novel techniques that make it possible to build an industrial-strength tool for automating the choice of indexes in the physical design of a SQL database...
205
click to vote
DAC
1989
ACM
15 years 11 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
173
click to vote
APPROX
2007
Springer
15 years 11 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
226
click to vote
FOSSACS
2007
Springer
15 years 11 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
207
click to vote
CIBB
2008
15 years 9 months ago
2008
A system for utilizing an artificial neural network to predict splice sites in genes has been studied. The neural network uses a sliding window of nucleotides over a gene and predi...