Sciweavers

5153 search results - page 620 / 1031
» Introduction to Randomized Algorithms
Sort
View
IJCAI
2001
15 years 6 months ago
Balance and Filtering in Structured Satisfiable Problems
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas...
COLING
1996
15 years 6 months ago
Learning Dependencies between Case Frame Slots
We address the problem of automatically acquiring case frame patterns (selectional patterns) from large corpus data. In particular, we l)ropose a method of learning dependencies b...
Hang Li, Naoki Abe
NIPS
1996
15 years 6 months ago
Combinations of Weak Classifiers
To obtain classification systems with both good generalizat`ion performance and efficiency in space and time, we propose a learning method based on combinations of weak classifiers...
Chuanyi Ji, Sheng Ma
CHES
2010
Springer
159views Cryptology» more  CHES 2010»
15 years 6 months ago
Provably Secure Higher-Order Masking of AES
Implementations of cryptographic algorithms are vulnerable to Side Channel Analysis (SCA). To counteract it, masking schemes are usually involved which randomize key-dependent data...
Matthieu Rivain, Emmanuel Prouff
ECCV
2010
Springer
15 years 6 months ago
Semantic Segmentation of Urban Scenes Using Dense Depth Maps
In this paper we present a framework for semantic scene parsing and object recognition based on dense depth maps. Five viewindependent 3D features that vary with object class are e...
Chenxi Zhang, Liang Wang, Ruigang Yang