844 search results - page 30 / 169 » Solving the p |
AMT
2006
Springer
15 years 1 months ago
2006
Springer
Text classification using positive and unlabeled data refers to the problem of building text classifier using positive documents (P) of one class and unlabeled documents (U) of man...
ISPA
2005
Springer
15 years 3 months ago
2005
Springer
Since cognition could be treated as problem-solving issues based on dynamical knowledge transferring and propagation, the meta-learning and group learning are put forward in confor...
COMPGEOM
2007
ACM
15 years 1 months ago
2007
ACM
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
CAI
2010
Springer
14 years 7 months ago
2010
Springer
The problem of finding a constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. Its goal is to find a longe...
EOR
2010
14 years 9 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...