308 search results - page 16 / 62 » How Fast Is the k-Means Method |
146
Voted
VIS
2007
IEEE
16 years 4 months ago
2007
IEEE
Recent developments in biomedical imaging are producing massive data sets containing structures, such as fine filaments, that are difficult to visualize. In this paper, we describ...
122
Voted
AAAI
1998
15 years 5 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
121
click to vote
BMCBI
2005
15 years 3 months ago
2005
Background: Profile-profile methods have been used for some years now to detect and align homologous proteins. The best such methods use information from the background distributi...
148
Voted
IWMM
2000
Springer
15 years 7 months ago
2000
Springer
Dynamic memory allocation is an important part of modern programming languages. It is important that it be done fast without wasting too much memory. Memory allocation using lazy ...
133
Voted
CLEF
2008
Springer
15 years 5 months ago
2008
Springer
In this article, we focus our efforts (i) on the study of how to automatically extract and exploit visual concepts and (ii) on fast visual diversity. First, in the Visual Concept D...