4781 search results - page 355 / 957 » Complexity at large |
120
click to vote
NIPS
1990
15 years 5 months ago
1990
Previous work (M.I. Sereno, 1989; cf. M.E. Sereno, 1987) showed that a feedforward network with area V1-like input-layer units and a Hebb rule can develop area MT-like second laye...
143
click to vote
EUROPAR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Complex software systems use many shared libraries frequently composed of large off-the-shelf components. Only a limited number of functions are used from these shared li...
127
click to vote
CSCL
2007
15 years 4 months ago
2007
This article describes the impact of learning in asynchronous discussion groups on students’ levels of knowledge construction. A design-based approach enabled the comparison of t...
131
click to vote
INFORMATICALT
1998
15 years 4 months ago
1998
Abstract. We study invertibility of big n × n matrices. There exists a number of algorithms, especially in mathematical statistics and numerical mathematics, requiring to invert s...
172
click to vote
ECCV
2008
Springer
16 years 6 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...