Sciweavers

3735 search results - page 635 / 747
» Order compression schemes
Sort
View
CPAIOR
2006
Springer
15 years 4 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
15 years 4 months ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval
139
Voted
CVPR
2006
IEEE
15 years 4 months ago
Accurate Tracking of Monotonically Advancing Fronts
A wide range of computer vision applications such as distance field computation, shape from shading, and shape representation require an accurate solution of a particular Hamilton...
M. Sabry Hassouna, Aly A. Farag
DAGM
2006
Springer
15 years 4 months ago
Towards Unsupervised Discovery of Visual Categories
Recently, many approaches have been proposed for visual object category detection. They vary greatly in terms of how much supervision is needed. High performance object detection m...
Mario Fritz, Bernt Schiele
128
Voted
DAS
2006
Springer
15 years 4 months ago
Segmentation of On-Line Handwritten Japanese Text Using SVM for Improving Text Recognition
Abstract. This paper describes a method of producing segmentation point candidates for on-line handwritten Japanese text by a support vector machine (SVM) to improve text recogniti...
Bilan Zhu, Junko Tokuno, Masaki Nakagawa