Sciweavers

746 search results - page 18 / 150
» Fast (Structured) Newton Computations
Sort
View
EDBT
2012
ACM
395views Database» more  EDBT 2012»
11 years 10 months ago
Data management with SAPs in-memory computing engine
We present some architectural and technological insights on SAP’s HANA database and derive research challenges for future enterprise application development. The HANA database m...
Joos-Hendrik Boese, Cafer Tosun, Christian Mathis,...
CVPR
2009
IEEE
15 years 2 months ago
On Compositional Image Alignment with an Application to Active Appearance Models
Efficient and accurate fitting of Active Appearance Models (AAM) is a key requirement for many applications. The most efficient fitting algorithm today is Inverse Compositional ...
Brian Amberg (University of Basel), Andrew Blake (...
STACS
2007
Springer
14 years 1 months ago
On Fixed Point Equations over Commutative Semirings
Fixed point equations x = f(x) over ω-continuous semirings can be seen as the mathematical foundation of interprocedural program analysis. The sequence 0, f(0), f2 (0), . . . conv...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
PPOPP
2012
ACM
12 years 3 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
13 years 2 months ago
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eri...