1772 search results - page 82 / 355 » Classifying Problems into Complexity Classes |
86
Voted
COCO
1998
Springer
15 years 4 months ago
1998
Springer
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
113
click to vote
PAMI
2007
15 years 2 days ago
2007
—A probabilistic formulation for semantic image annotation and retrieval is proposed. Annotation and retrieval are posed as classification problems where each class is defined as...
106
click to vote
ICRA
2006
IEEE
15 years 6 months ago
2006
IEEE
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
112
click to vote
SIAMNUM
2010
14 years 7 months ago
2010
In the numerical simulation of many practical problems in physics and engineering, finite volume methods are an important and popular class of discretization methods due to the loc...
118
Voted
AMT
2006
Springer
15 years 4 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...