4378 search results - page 667 / 876 » On the Complexity of Ordered Colourings |
152
click to vote
PR
2008
15 years 6 months ago
2008
Prototype selection problem consists of reducing the size of databases by removing samples that are considered noisy or not influential on nearest neighbour classification tasks. ...
157
click to vote
PR
2006
15 years 6 months ago
2006
Fingerprint matching is still a challenging problem for reliable person authentication because of the complex distortions involved in two impressions of the same finger. In this p...
175
click to vote
SIAMIS
2008
15 years 6 months ago
2008
We propose, analyze and test an alternating minimization algorithm for recovering images from blurry and noisy observations with total variation (TV) regularization. This algorith...
167
click to vote
AIEDU
2005
15 years 6 months ago
2005
In this paper, we explore the problem of selecting appropriate interventions for students based on an analysis of their interactions with a tutoring system. In the context of the W...
175
click to vote
TCS
2008
15 years 6 months ago
2008
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...