Sciweavers

358 search results - page 28 / 72
» GCD of Many Integers
Sort
View
AMW
2009
13 years 8 months ago
Using Patterns for Faster and Scalable Rewriting of Conjunctive Queries
Abstract. Rewriting of conjunctive queries using views has many applications in database and data integration. We investigate ways to improve performance of rewriting and propose a...
Ali Kiani, Nematollaah Shiri
ICML
2010
IEEE
13 years 8 months ago
Learning Sparse SVM for Feature Selection on Very High Dimensional Datasets
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...
Mingkui Tan, Li Wang, Ivor W. Tsang
EJC
2007
13 years 7 months ago
Constructing t-designs from t-wise balanced designs
We give a construction to obtain a t-design from a t-wise balanced design. More precisely, given a positive integer k and a t(v, {k1, k2, . . . , ks}, λ) design D, with with all ...
John P. McSorley, Leonard H. Soicher
SIAMCOMP
2000
76views more  SIAMCOMP 2000»
13 years 7 months ago
On Interpolation and Automatization for Frege Systems
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system ...
Maria Luisa Bonet, Toniann Pitassi, Ran Raz
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...