1568 search results - page 224 / 314 » The problem of examination questions in algorithmics |
122
click to vote
BMCBI
2005
15 years 4 months ago
2005
Abstract. Taxonomy provides one of the most powerful ways to navigate sequence data bases but currently, users are forced to formulate queries according to a single taxonomic class...
144
click to vote
ICDM
2010
IEEE
15 years 2 months ago
2010
IEEE
A city offers thousands of social events a day, and it is difficult for dwellers to make choices. The combination of mobile phones and recommender systems can change the way one de...
154
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
For large, real-world inductive learning problems, the number of training examples often must be limited due to the costs associated with procuring, preparing, and storing the tra...
131
click to vote
ECCC
2006
15 years 4 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
121
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
We consider the problem of learning mixtures of product distributions over discrete domains in the distribution learning framework introduced by Kearns et al. [18]. We give a poly...