Sciweavers

350 search results - page 32 / 70
» Soft Linear Set Theory
Sort
View
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
15 years 10 months ago
Green's conjecture and testing linear-invariant properties
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
Asaf Shapira
CSL
2005
Springer
15 years 9 months ago
Towards a Typed Geometry of Interaction
Abstract. Girard’s Geometry of Interaction (GoI) develops a mathematical framework for modelling the dynamics of cut-elimination. We introduce a typed version of GoI, called Mult...
Esfandiar Haghverdi, Philip J. Scott
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
15 years 10 months ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen
ICPR
2006
IEEE
16 years 4 months ago
Dimensionality Reduction with Adaptive Kernels
1 A kernel determines the inductive bias of a learning algorithm on a specific data set, and it is beneficial to design specific kernel for a given data set. In this work, we propo...
Shuicheng Yan, Xiaoou Tang
ISVC
2009
Springer
15 years 10 months ago
Combinatorial Preconditioners and Multilevel Solvers for Problems in Computer Vision and Image Processing
Abstract. Linear systems and eigen-calculations on symmetric diagonally dominant matrices (SDDs) occur ubiquitously in computer vision, computer graphics, and machine learning. In ...
Ioannis Koutis, Gary L. Miller, David Tolliver