6274 search results - page 642 / 1255 » From query complexity to computational complexity |
182
click to vote
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
AAAI
2000
15 years 8 months ago
2000
Self-organizing models develop realistic cortical structures when given approximations of the visual environment as input, and are an effective way to model the development of fac...
194
click to vote
SIP
2003
15 years 8 months ago
2003
This paper presents an efficient method for designing full band IIR digital differentiators in the complex Chebyshev sense. The proposed method is based on the formulation of a g...
228
click to vote
GLOBECOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Hash functions have a space complexity of O(n) and a possible time complexity of O(1). Thus, packet classifiers exploit hashing to achieve packet classification in wire speed. Esp...
206
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: A good scoring function is essential for molecular docking computations. In conventional scoring functions, energy terms modeling pairwise interactions are cumulativel...