Sciweavers

5344 search results - page 626 / 1069
» Privacy-Preserving Set Operations
Sort
View
ANOR
2011
117views more  ANOR 2011»
14 years 10 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
NETWORKING
2011
14 years 9 months ago
oBGP: An Overlay for a Scalable iBGP Control Plane
The Internet is organized as a collection of networks called Autonomous Systems (ASes). The Border Gateway Protocol (BGP) is the glue that connects these administrative domains. Co...
Iuniana M. Oprescu, Mickael Meulle, Steve Uhlig, C...
ASPLOS
2004
ACM
16 years 8 days ago
Secure program execution via dynamic information flow tracking
Dynamic information flow tracking is a hardware mechanism to protect programs against malicious attacks by identifying spurious information flows and restricting the usage of sp...
G. Edward Suh, Jae W. Lee, David Zhang, Srinivas D...

Presentation
439views
14 years 20 days ago
Efficient Evaluation Methods of Elementary Functions Suitable for SIMD Computation
Data-parallel architectures like SIMD (Single Instruction Multiple Data) or SIMT (Single Instruction Multiple Thread) have been adopted in many recent CPU and GPU architectures. Al...
233
Voted
JMLR
2012
13 years 9 months ago
A General Framework for Structured Sparsity via Proximal Optimization
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
Luca Baldassarre, Jean Morales, Andreas Argyriou, ...