8689 search results - page 424 / 1738 » Software: hard data |
155
Voted
FSTTCS
1992
Springer
15 years 11 months ago
1992
Springer
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
221
Voted
ISSRE
2010
IEEE
15 years 5 months ago
2010
IEEE
— With the increasing reliance of complex real-world applications on composite web services assembled from independently developed component services, there is a growing need for...
184
click to vote
PROFES
2010
Springer
15 years 10 months ago
2010
Springer
Collecting large consistent data sets for real world software projects is problematic. Therefore, we explore how little data are required before the predictor performance plateaus...
160
Voted
NIPS
2003
15 years 8 months ago
2003
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...
170
click to vote
PAMI
2002
15 years 6 months ago
2002
In this article, we evaluate the performance of three clustering algorithms, hard K-Means, single linkage, and a simulated annealing (SA) based technique, in conjunction with four ...