Sciweavers

1429 search results - page 259 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
AAAI
2011
12 years 7 months ago
Coarse-to-Fine Inference and Learning for First-Order Probabilistic Models
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
Chloe Kiddon, Pedro Domingos
CVPR
2012
IEEE
11 years 10 months ago
Detecting activities of daily living in first-person camera views
We present a novel dataset and novel algorithms for the problem of detecting activities of daily living (ADL) in firstperson camera views. We have collected a dataset of 1 millio...
Hamed Pirsiavash, Deva Ramanan
EUROCRYPT
2012
Springer
11 years 10 months ago
Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
We describe a compression technique that reduces the public key size of van Dijk, Gentry, Halevi and Vaikuntanathan’s (DGHV) fully homomorphic scheme over the integers from ˜O(...
Jean-Sébastien Coron, David Naccache, Mehdi...
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 8 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
EMO
2009
Springer
140views Optimization» more  EMO 2009»
14 years 5 days ago
On Using Populations of Sets in Multiobjective Optimization
Abstract. Most existing evolutionary approaches to multiobjective optimization aim at finding an appropriate set of compromise solutions, ideally a subset of the Pareto-optimal se...
Johannes Bader, Dimo Brockhoff, Samuel Welten, Eck...