Sciweavers

287 search results - page 24 / 58
» Exact Cover with light
Sort
View
NIPS
2000
14 years 6 days ago
Incremental and Decremental Support Vector Machine Learning
An on-line recursive algorithm for training support vector machines, one vector at a time, is presented. Adiabatic increments retain the KuhnTucker conditions on all previously se...
Gert Cauwenberghs, Tomaso Poggio
JSYML
2000
78views more  JSYML 2000»
13 years 10 months ago
On Quantification with A Finite Universe
We consider a finite universe U (more exactly - a family U of them), second order quantifiers QK , where for each U this means quantifying over a family of n(K)-place relations clo...
Saharon Shelah
FTDB
2011
98views more  FTDB 2011»
13 years 2 months ago
Secure Distributed Data Aggregation
We present a survey of the various families of approaches to secure aggregation in distributed networks such as sensor networks. In our survey, we focus on the important algorithm...
Haowen Chan, Hsu-Chun Hsiao, Adrian Perrig, Dawn S...
SCN
2008
Springer
105views Communications» more  SCN 2008»
13 years 10 months ago
Expressive Subgroup Signatures
In this work, we propose a new generalization of the notion of group signatures, that allows signers to cover the entire spectrum from complete disclosure to complete anonymity. Pr...
Xavier Boyen, Cécile Delerablée
ADBIS
2000
Springer
79views Database» more  ADBIS 2000»
14 years 3 months ago
Distributed Searching of k-Dimensional Data with Almost Constant Costs
Abstract. In this paper we consider the dictionary problem in the scalable distributed data structure paradigm introduced by Litwin, Neimat and Schneider and analyze costs for inse...
Adriano Di Pasquale, Enrico Nardelli