Sciweavers

1066 search results - page 47 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
NIPS
2004
14 years 11 months ago
Computing regularization paths for learning multiple kernels
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
Francis R. Bach, Romain Thibaux, Michael I. Jordan
SENSYS
2010
ACM
14 years 7 months ago
Privacy-aware regression modeling of participatory sensing data
Many participatory sensing applications use data collected by participants to construct a public model of a system or phenomenon. For example, a health application might compute a...
Hossein Ahmadi, Nam Pham, Raghu K. Ganti, Tarek F....
EVOW
2007
Springer
15 years 1 months ago
Scale Invariance for Evolved Interest Operators
Abstract. This work presents scale invariant region detectors that apply evolved operators to extract an interest measure. We evaluate operators using their repeatability rate, and...
Leonardo Trujillo, Gustavo Olague
ICCAD
1995
IEEE
127views Hardware» more  ICCAD 1995»
15 years 1 months ago
Hybrid decision diagrams
Abstract: Functions that map boolean vectors into the integers are important for the design and veri cation of arithmetic circuits. MTBDDs and BMDs have been proposed for represent...
Edmund M. Clarke, Masahiro Fujita, Xudong Zhao
STACS
2007
Springer
15 years 3 months ago
On the Complexity of Unary Tiling-Recognizable Picture Languages
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
Alberto Bertoni, Massimiliano Goldwurm, Violetta L...