8655 search results - page 336 / 1731 » Challenges for Trusted Computing |
331
click to vote
ICDE
2001
IEEE
16 years 5 months ago
2001
IEEE
We consider the problems of computing aggregation queries in temporal databases, and of maintaining materialized temporal aggregate views efficiently. The latter problem is partic...
212
click to vote
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
127
Voted
ICCD
2005
IEEE
16 years 15 days ago
2005
IEEE
FPGAs (Field-Programmable Gate Arrays) are often used as coprocessors to boost the performance of dataintensive applications [1, 2]. However, mapping algorithms onto multimillion-...
124
Voted
SEUS
2009
IEEE
15 years 10 months ago
2009
IEEE
Publish-subscribe-query information broker middleware offers great promise to users of pervasive computing systems requiring access to information. However, users of publish-subscr...
116
Voted
DATE
2006
IEEE
15 years 9 months ago
2006
IEEE
Soft errors have emerged as an important reliability challenge for nanoscale VLSI designs. In this paper, we present a fast and efficient soft error rate (SER) computation algorit...