Sciweavers

195 search results - page 13 / 39
» Another View of the Gaussian Algorithm
Sort
View
94
Voted
DEXA
1998
Springer
179views Database» more  DEXA 1998»
15 years 1 months ago
Concurrent Warehouse Maintenance Without Compromising Session Consistency
Abstract. To achieve acceptable query response times in data warehouse environments, the data have to be pre-aggregated according to the need of the applications and stored redunda...
Michael Teschke, Achim Ulbrich
82
Voted
PPL
2010
117views more  PPL 2010»
14 years 4 months ago
Neighborhood Structures for GPU-Based Local Search Algorithms
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
CORR
2011
Springer
168views Education» more  CORR 2011»
14 years 4 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe
80
Voted
CVPR
2003
IEEE
15 years 11 months ago
Computing Layered Surface Representations: An Algorithm for Detecting and Separating Transparent Overlays
The biological visual system possesses the ability to compute layered surface representations, in which one surface is represented as being viewed through another. This ability is...
Manish Singh, Xiaolei Huang
ICALP
2007
Springer
15 years 3 months ago
Parameterized Algorithms for Directed Maximum Leaf Problems
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...