Sciweavers

2516 search results - page 43 / 504
» When is there a representer theorem
Sort
View
CHES
2007
Springer
105views Cryptology» more  CHES 2007»
16 years 12 days ago
On the Implementation of a Fast Prime Generation Algorithm
Abstract. A side-channel analysis of a cryptographic algorithm generally concentrates on the encryption or decryption phases, rarely on the key generation phase. In this paper, we ...
Christophe Clavier, Jean-Sébastien Coron
LPAR
2010
Springer
15 years 4 months ago
Polite Theories Revisited
The classic method of Nelson and Oppen for combining decision procedures requires the theories to be stably-infinite. Unfortunately, some important theories do not fall into this...
Dejan Jovanovic, Clark Barrett
SIGECOM
2011
ACM
220views ECommerce» more  SIGECOM 2011»
14 years 9 months ago
Multilateral matching
We introduce a matching model in which agents engage in joint ventures via multilateral contracts. This approach allows us to consider production complementarities previously outs...
John William Hatfield, Scott Duke Kominers
143
Voted
ICMCS
2006
IEEE
104views Multimedia» more  ICMCS 2006»
16 years 7 days ago
A Study on Spatial Scalable Coding using Vector Representation
The major advantage of vector representation of an image is that the image quality is maintained for arbitrary scaling. In recent years, a demand for scalable image coding has bee...
Yuki Yamamoto, Kei Kawamura, Hiroshi Watanabe
ACL
2008
15 years 7 months ago
Task-oriented Evaluation of Syntactic Parsers and Their Representations
This paper presents a comparative evaluation of several state-of-the-art English parsers based on different frameworks. Our approach is to measure the impact of each parser when i...
Yusuke Miyao, Rune Sætre, Kenji Sagae, Takuy...