Sciweavers

86 search results - page 5 / 18
» On the complexity of optimization over the standard simplex
Sort
View
CHES
2009
Springer
230views Cryptology» more  CHES 2009»
15 years 10 months ago
Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...
David Kammler, Diandian Zhang, Dominik Auras, Gerd...
83
Voted
SIGGRAPH
2000
ACM
15 years 1 months ago
As-rigid-as-possible shape interpolation
We present an object-space morphing technique that blends the interiors of given two- or three-dimensional shapes rather than their boundaries. The morph is rigid in the sense tha...
Marc Alexa, Daniel Cohen-Or, David Levin
JMLR
2012
12 years 12 months ago
Multi Kernel Learning with Online-Batch Optimization
In recent years there has been a lot of interest in designing principled classification algorithms over multiple cues, based on the intuitive notion that using more features shou...
Francesco Orabona, Jie Luo, Barbara Caputo
ICIP
2006
IEEE
15 years 11 months ago
Low Complexity Inter-Mode Selection for H.264
The coding efficiency of the H.264/AVC standard enables the transmission of high quality video over bandwidth limited networks. Due to the use of multiple Macroblock (MB) partitio...
Seydou-Nourou Ba, Yucel Altunbasak, Hasan F. Ates
KR
2010
Springer
15 years 2 months ago
Worst-Case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
Magdalena Ortiz, Sebastian Rudolph, Mantas Simkus