10934 search results - page 1978 / 2187 » High performance computing and communications |
204
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
220
click to vote
SIGIR
2012
ACM
13 years 9 months ago
2012
ACM
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
177
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Heterogeneous data co-clustering has attracted more and more attention in recent years due to its high impact on various applications. While the co-clustering algorithms for two t...
397
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
164
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Software agents help automate a variety of tasks including those involved in buying and selling products over the internet. The need for handling complex highly configurable produ...