5215 search results - page 407 / 1043 » Quantum clustering algorithms |
141
click to vote
WSC
2004
15 years 8 months ago
2004
Simulation methods are extensively used in modeling complex scheduling problems. However, traditional layout of simulation models can become complicated when they are used to find...
187
click to vote
SODA
1998
ACM
15 years 8 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
178
click to vote
CIBCB
2009
IEEE
15 years 4 months ago
2009
IEEE
We propose an Automatic Gene Ontology (AGO) software as a flexible, open-source Matlab software tool that allows the user to easily compare the results of the bicluster and cluster...
186
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
160
click to vote
AI
2009
Springer
16 years 1 months ago
2009
Springer
The manipulation of large-scale document data sets often involves the processing of a wealth of features that correspond with the available terms in the document space. The employm...