Sciweavers

3897 search results - page 289 / 780
» complexity 2010
Sort
View
ICICS
2010
Springer
15 years 4 months ago
Unconditionally Secure First-Price Auction Protocols Using a Multicomponent Commitment Scheme
Due to the rapid growth of e-commerce technology, secure auction protocols have attracted much attention among researchers. The main reason for constructing sealed-bid auction prot...
Mehrdad Nojoumian, Douglas R. Stinson
ECCV
2010
Springer
15 years 12 months ago
Rotation invariant non-rigid shape matching in cluttered scenes
Abstract. This paper presents a novel and efficient method for locating deformable shapes in cluttered scenes. The shapes to be detected may undergo arbitrary translational and rot...
ICAISC
2010
Springer
15 years 11 months ago
Quasi-parametric Recovery of Hammerstein System Nonlinearity by Smart Model Selection
In the paper we recover a Hammerstein system nonlinearity. Hammerstein systems, incorporating nonlinearity and dynamics, play an important role in various applications, and e¤ecti...
Zygmunt Hasiewicz, Grzegorz Mzyk, Przemyslaw Sliwi...
ICGI
2010
Springer
15 years 7 months ago
Inferring Regular Trace Languages from Positive and Negative Samples
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
Antonio Cano Gómez
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 6 months ago
On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
Iryna Andriyanova, Jean-Pierre Tillich