186 search results - page 28 / 38 » A parallel evolutionary algorithm to optimize dynamic data t... |
140
Voted
DEBS
2007
ACM
15 years 6 months ago
2007
ACM
Content-based publish/subscribe systems allow matching the content of events with predicates in the subscriptions. However, most existing systems only allow a limited set of opera...
132
Voted
ICCAD
2009
IEEE
15 years 10 days ago
2009
IEEE
Hardware acceleration is crucial in modern embedded system design to meet the explosive demands on performance and cost. Selected computation kernels for acceleration are usually ...
138
Voted
SENSYS
2003
ACM
15 years 7 months ago
2003
ACM
Simple in-network data aggregation (or fusion) techniques for sensor networks have been the focus of several recent research efforts, but they are insufficient to support advance...
144
Voted
EGH
2010
Springer
15 years 17 days ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
135
click to vote
CIKM
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...