Sciweavers

1007 search results - page 178 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
DEBS
2007
ACM
15 years 3 months ago
Scalable event matching for overlapping subscriptions in pub/sub systems
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...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
ASPLOS
2000
ACM
15 years 4 months ago
Architectural Support for Fast Symmetric-Key Cryptography
The emergence of the Internet as a trusted medium for commerce and communication has made cryptography an essential component of modern information systems. Cryptography provides ...
Jerome Burke, John McDonald, Todd M. Austin
ASPLOS
2010
ACM
14 years 10 months ago
Best-effort semantic document search on GPUs
Semantic indexing is a popular technique used to access and organize large amounts of unstructured text data. We describe an optimized implementation of semantic indexing and docu...
Surendra Byna, Jiayuan Meng, Anand Raghunathan, Sr...
PPOPP
2006
ACM
15 years 5 months ago
Performance characterization of molecular dynamics techniques for biomolecular simulations
Large-scale simulations and computational modeling using molecular dynamics (MD) continues to make significant impacts in the field of biology. It is well known that simulations...
Sadaf R. Alam, Jeffrey S. Vetter, Pratul K. Agarwa...
ISCAS
2005
IEEE
129views Hardware» more  ISCAS 2005»
15 years 5 months ago
A reconfigurable architecture for scanning biosequence databases
—Unknown protein sequences are often compared to a set of known sequences (a database scan) to detect functional similarities. Even though efficient dynamic programming algorithm...
Timothy F. Oliver, Bertil Schmidt, Douglas L. Mask...