821 search results - page 55 / 165 » Scalable Keyword Search on Large Data Streams |
119
click to vote
KDD
2008
ACM
16 years 6 days ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
114
click to vote
ICAC
2005
IEEE
15 years 5 months ago
2005
IEEE
Large data centers host several application environments (AEs) that are subject to workloads whose intensity varies widely and unpredictably. Therefore, the servers of the data ce...
122
click to vote
KDD
2007
ACM
16 years 6 days ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
ISCA
2010
IEEE
15 years 4 months ago
2010
IEEE
Chip Multiprocessors (CMPs) are now commodity hardware, but commoditization of parallel software remains elusive. In the near term, the current trend of increased coreper-socket c...
108
click to vote
MICRO
2005
IEEE
15 years 5 months ago
2005
IEEE
Conventional processors use a fully-associative store queue (SQ) to implement store-load forwarding. Associative search latency does not scale well to capacities and bandwidths re...