2661 search results - page 349 / 533 » Quantum Complexity Classes |
138
Voted
PAKDD
2009
ACM
15 years 10 months ago
2009
ACM
One important problem proposed recently in the field of web mining is website classification problem. The complexity together with the necessity to have accurate and fast algorit...
134
Voted
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
139
Voted
ICRA
2006
IEEE
15 years 9 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...
129
Voted
STACS
2001
Springer
15 years 8 months ago
2001
Springer
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...
115
Voted
ALT
1999
Springer
15 years 8 months ago
1999
Springer
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...