Sciweavers

364 search results - page 14 / 73
» Dimension Characterizations of Complexity Classes
Sort
View
LOGCOM
2007
92views more  LOGCOM 2007»
13 years 7 months ago
Third-Order Computation and Bounded Arithmetic
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
Alan Skelley
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 7 months ago
Online Learning: Random Averages, Combinatorial Parameters, and Learnability
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
PODS
2010
ACM
223views Database» more  PODS 2010»
13 years 9 months ago
Characterizing schema mappings via data examples
Schema mappings are high-level specifications that describe the relationship between two database schemas; they are considered to be the essential building blocks in data exchange...
Bogdan Alexe, Phokion G. Kolaitis, Wang Chiew Tan
APPML
2007
58views more  APPML 2007»
13 years 7 months ago
A class of exactly solvable free-boundary inhomogeneous porous medium flows
We describe a class of inhomogeneous two-dimensional porous medium flows, driven by a finite number of multipole sources; the free boundary dynamics can be parametrized by polyn...
Sam D. Howison, Igor Loutsenko, John R. Ockendon
ROMAN
2007
IEEE
126views Robotics» more  ROMAN 2007»
14 years 1 months ago
Classes of Applications for Social Robots: A User Study
– The paper introduces an online user study on applications for social robots with 127 participants. The potential users proposed 570 application scenarios based on the appearanc...
Frank Hegel, Monja Lohse, Agnes Swadzba, Sven Wach...