Sciweavers

619 search results - page 35 / 124
» A Kernel Method for the Two-Sample Problem
Sort
View
117
Voted
AAAI
2000
15 years 4 months ago
The Complexity of Restricted Consequence Finding and Abduction
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
Alvaro del Val
ICASSP
2011
IEEE
14 years 6 months ago
Motion vector recovery with Gaussian Process Regression
In this paper, we propose a Gaussian Process Regression (GPR) framework for concealment of corrupted motion vectors in predictive video coding of packet video systems. The problem...
Hadi Asheri, Abdolkhalegh Bayati, Hamid R. Rabiee,...
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
15 years 3 months ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue
104
Voted
AAECC
2001
Springer
121views Algorithms» more  AAECC 2001»
15 years 7 months ago
Algorithms for Large Integer Matrix Problems
Abstract. New algorithms are described and analysed for solving various problems associated with a large integer matrix: computing the Hermite form, computing a kernel basis, and s...
Mark Giesbrecht, Michael J. Jacobson Jr., Arne Sto...
LATIN
2010
Springer
15 years 9 months ago
Kernelization through Tidying
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
René van Bevern, Hannes Moser, Rolf Niederm...