Sciweavers

1066 search results - page 13 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 2 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
CVPR
2007
IEEE
15 years 11 months ago
Incremental Linear Discriminant Analysis Using Sufficient Spanning Set Approximations
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
Björn Stenger, Josef Kittler, Roberto Cipolla...
SG
2005
Springer
15 years 3 months ago
Generation of Glyphs for Conveying Complex Information, with Application to Protein Representations
Abstract. We present a method to generate glyphs which convey complex information in graphical form. A glyph has a linear geometry which is specified using geometric operations, e...
Greg Pintilie, Brigitte Tuekam, Christopher W. V. ...
ECCTD
2011
108views more  ECCTD 2011»
13 years 9 months ago
Low complexity least-squares filter design for the correction of linear time-varying systems
Abstract—In this paper, a low complexity algorithm for the design of a time-varying correction filter of finite impulse response (FIR) type is presented. Using the obtained fi...
Michael Soudan, Christian Vogel
ANTS
2006
Springer
78views Algorithms» more  ANTS 2006»
15 years 1 months ago
Hidden Pairings and Trapdoor DDH Groups
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
Alexander W. Dent, Steven D. Galbraith