6181 search results - page 498 / 1237 » Transactional Cluster Computing |
183
click to vote
CCGRID
2003
IEEE
16 years 9 days ago
2003
IEEE
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...
184
click to vote
BMCBI
2005
15 years 7 months ago
2005
Background: Computational protein annotation methods occasionally introduce errors. Falsepositive (FP) errors are annotations that are mistakenly associated with a protein. Such f...
245
click to vote
RTSS
2007
IEEE
16 years 1 months ago
2007
IEEE
It is challenging to process transactions in a timely fashion using fresh data, e.g., current stock prices, since database workloads may considerably vary due to dynamic data/reso...
197
click to vote
ASAP
2005
IEEE
16 years 20 days ago
2005
IEEE
As billion transistor System-on-chips (SoC) become commonplace and design complexity continues to increase, designers are faced with the daunting task of meeting escalating design...
225
click to vote
ADC
2003
Springer
16 years 8 days ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...