Sciweavers

268 search results - page 40 / 54
» Recursion Theoretic Operators for Function Complexity Classe...
Sort
View
70
Voted
PVLDB
2010
91views more  PVLDB 2010»
14 years 8 months ago
Regret-Minimizing Representative Databases
We propose the k-representative regret minimization query (k-regret) as an operation to support multi-criteria decision making. Like top-k, the k-regret query assumes that users h...
Danupon Nanongkai, Atish Das Sarma, Ashwin Lall, R...
CSR
2009
Springer
15 years 4 months ago
Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
Abstract. We study structural properties of restricted width arithmetical circuits. It is shown that syntactically multilinear arithmetical circuits of constant width can be effici...
Maurice J. Jansen, B. V. Raghavendra Rao
VLDB
1999
ACM
89views Database» more  VLDB 1999»
15 years 1 months ago
Physical Data Independence, Constraints, and Optimization with Universal Plans
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
Alin Deutsch, Lucian Popa, Val Tannen
INFORMATICALT
1998
89views more  INFORMATICALT 1998»
14 years 9 months ago
Simply Invertible Matrices and Fast Prediction
Abstract. We study invertibility of big n × n matrices. There exists a number of algorithms, especially in mathematical statistics and numerical mathematics, requiring to invert s...
Valdas Diciunas
HASKELL
2008
ACM
14 years 10 months ago
Lightweight monadic regions
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
Oleg Kiselyov, Chung-chieh Shan