1568 search results - page 101 / 314 » The problem of examination questions in algorithmics |
120
click to vote
ECCC
2010
15 years 4 months ago
2010
We introduce a new approach to characterizing the unobserved portion of a distribution, which provides sublinear-sample additive estimators for a class of properties that includes...
157
click to vote
NIPS
2004
15 years 5 months ago
2004
Given a directed graph in which some of the nodes are labeled, we investigate the question of how to exploit the link structure of the graph to infer the labels of the remaining u...
171
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
139
click to vote
VMCAI
2007
Springer
15 years 10 months ago
2007
Springer
We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of pro...
120
click to vote
ECCC
2008
15 years 4 months ago
2008
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...