953 search results - page 44 / 191 » Efficient Evaluation of Large Polynomials |
LWA
2004
13 years 9 months ago
2004
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
CN
2010
13 years 8 months ago
2010
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
DEBS
2009
ACM
13 years 11 months ago
2009
ACM
One of the main challenges faced by content-based publish/subscribe systems is handling large amount of dynamic subscriptions and publications in a multidimensional content space....
VLDB
1997
ACM
13 years 11 months ago
1997
ACM
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
LREC
2010
13 years 9 months ago
2010
We introduce CCASH (Cost-Conscious Annotation Supervised by Humans), an extensible web application framework for cost-efficient annotation. CCASH provides a framework in which cos...