Sciweavers

9841 search results - page 710 / 1969
» Distributed Value Functions
Sort
View
ECCC
2010
78views more  ECCC 2010»
15 years 7 months ago
PCPs and the Hardness of Generating Synthetic Data
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...
Jonathan Ullman, Salil P. Vadhan
CSDA
2006
100views more  CSDA 2006»
15 years 7 months ago
Implementing a class of structural change tests: An econometric computing approach
The implementation of a recently suggested class of structural change tests, which test for parameter instability in general parametric models, in the R language for statistical c...
Achim Zeileis
CORR
2007
Springer
93views Education» more  CORR 2007»
15 years 7 months ago
Intrinsic dimension of a dataset: what properties does one expect?
— We propose an axiomatic approach to the concept of an intrinsic dimension of a dataset, based on a viewpoint of geometry of high-dimensional structures. Our first axiom postul...
Vladimir Pestov
IPL
2006
87views more  IPL 2006»
15 years 7 months ago
Vertex rankings of chordal graphs and weighted trees
: In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem o...
Dariusz Dereniowski, Adam Nadolski
JAIR
2006
122views more  JAIR 2006»
15 years 7 months ago
Solving Factored MDPs with Hybrid State and Action Variables
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...
Branislav Kveton, Milos Hauskrecht, Carlos Guestri...