Sciweavers

814 search results - page 115 / 163
» Improving the execution time of global communication operati...
Sort
View
EUROCRYPT
2011
Springer
14 years 5 months ago
Faster Explicit Formulas for Computing Pairings over Ordinary Curves
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
Diego F. Aranha, Koray Karabina, Patrick Longa, Ca...
ICDE
2012
IEEE
256views Database» more  ICDE 2012»
13 years 4 months ago
Micro-Specialization in DBMSes
Abstract—Relational database management systems are general in the sense that they can handle arbitrary schemas, queries, and modifications; this generality is implemented using...
Rui Zhang, Richard T. Snodgrass, Saumya Debray
AAAI
2012
13 years 4 months ago
Learning from Demonstration for Goal-Driven Autonomy
Goal-driven autonomy (GDA) is a conceptual model for creating an autonomous agent that monitors a set of expectations during plan execution, detects when discrepancies occur, buil...
Ben George Weber, Michael Mateas, Arnav Jhala
IEEEPACT
2005
IEEE
15 years 7 months ago
A Distributed Control Path Architecture for VLIW Processors
VLIW architectures are popular in embedded systems because they offer high-performance processing at low cost and energy. The major problem with traditional VLIW designs is that t...
Hongtao Zhong, Kevin Fan, Scott A. Mahlke, Michael...
DAGSTUHL
2007
15 years 3 months ago
Programming self developing blob machines for spatial computing.
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
Frédéric Gruau, Christine Eisenbeis