331 search results - page 43 / 67 » Comparing Reductions to NP-Complete Sets |
232
click to vote
ISNN
2011
Springer
14 years 6 months ago
2011
Springer
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
170
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: With the expansion of public repositories such as the Gene Expression Omnibus (GEO), we are rapidly cataloging cellular transcriptional responses to diverse experiment...
162
click to vote
CONCURRENCY
2010
15 years 1 months ago
2010
The faster growth curves in the speed of GPUs relative to CPUs in the past decade and its rapidly gained popularity have spawned a new area of development in computational technol...
129
click to vote
EUROCAST
2005
Springer
15 years 9 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
158
click to vote
CIKM
2006
Springer
15 years 7 months ago
2006
Springer
It is important yet hard to identify navigational queries in Web search due to a lack of sufficient information in Web queries, which are typically very short. In this paper we st...