Sciweavers

1542 search results - page 162 / 309
» Kernelization of packing problems
Sort
View
AAIM
2008
Springer
96views Algorithms» more  AAIM 2008»
15 years 8 months ago
Minimum Leaf Out-Branching Problems
Abstract. Given a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in D an out-branching with the minimum possible number of leaves, i.e., vert...
Gregory Gutin, Igor Razgon, Eun Jung Kim
ICIP
2006
IEEE
16 years 3 months ago
Support Vector Machines for Camera Calibration Problem
This paper presents a statistical learning-based solution to the camera calibration problem in which the Support Vector Machines (SVM) are used for the estimation of the projectio...
Refaat M. Mohamed, Abdelrehim H. Ahmed, Ahmed Eid,...
148
Voted
ICCSA
2003
Springer
15 years 7 months ago
Coarse-Grained Parallel Matrix-Free Solution of a Three-Dimensional Elliptic Prototype Problem
The finite difference discretization of the Poisson equation in three dimensions results in a large, sparse, and highly structured system of linear equations. This prototype prob...
Kevin P. Allen, Matthias K. Gobbert
PODC
2005
ACM
15 years 7 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
126
Voted
CORR
2010
Springer
174views Education» more  CORR 2010»
15 years 1 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor