Sciweavers

1533 search results - page 205 / 307
» Semantic Matching: Algorithms and Implementation
Sort
View
COCOON
2001
Springer
14 years 2 months ago
PC-Trees vs. PQ-Trees
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
Wen-Lian Hsu
APPROX
2006
Springer
179views Algorithms» more  APPROX 2006»
14 years 1 months ago
Adaptive Sampling and Fast Low-Rank Matrix Approximation
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
Amit Deshpande, Santosh Vempala
IJCAI
2007
13 years 11 months ago
Kernel Conjugate Gradient for Fast Kernel Machines
We propose a novel variant of the conjugate gradient algorithm, Kernel Conjugate Gradient (KCG), designed to speed up learning for kernel machines with differentiable loss functio...
Nathan D. Ratliff, J. Andrew Bagnell
IIS
2000
13 years 11 months ago
Speeding Up Evolution through Learning: LEM
This paper reports briefly on the development of a new approach to evolutionary computation, called the Learnable Evolution Model or LEM. In contrast to conventional Darwinian-typ...
Ryszard S. Michalski, Guido Cervone, Kenneth A. Ka...
INFOCOM
2010
IEEE
13 years 8 months ago
Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case
Abstract—We consider the power control problem in a timeslotted wireless channel, shared by a finite number of mobiles that transmit to a common base station. The channel betwee...
Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, ...