458 search results - page 74 / 92 » Perfect Skolem sets |
124
click to vote
FUN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
113
click to vote
NIPS
2004
15 years 1 months ago
2004
We describe a framework for learning an object classifier from a single example. This goal is achieved by emphasizing the relevant dimensions for classification using available ex...
106
click to vote
PODC
2011
ACM
14 years 2 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
We consider the problem of computing the likelihood of a gesture from regular, unaided video sequences, without relying on perfect segmentation of the scene. Instead of requiring ...
KDD
2008
ACM
16 years 5 days ago
2008
ACM
This paper addresses the repeated acquisition of labels for data items when the labeling is imperfect. We examine the improvement (or lack thereof) in data quality via repeated la...