Sciweavers

24188 search results - page 4447 / 4838
» Computing on Encrypted Data
Sort
View
CORR
2007
Springer
138views Education» more  CORR 2007»
15 years 6 months ago
On the Performance Evaluation of Encounter-based Worm Interactions Based on Node Characteristics
An encounter-based network is a frequently-disconnected wireless ad-hoc network requiring nearby neighbors to store and forward data utilizing mobility and encounters over time. U...
Sapon Tanachaiwiwat, Ahmed Helmy
CORR
2007
Springer
167views Education» more  CORR 2007»
15 years 6 months ago
Optimal Solutions for Sparse Principal Component Analysis
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonze...
Alexandre d'Aspremont, Francis R. Bach, Laurent El...
CORR
2007
Springer
113views Education» more  CORR 2007»
15 years 6 months ago
Virtual screening with support vector machines and structure kernels
Support vector machines and kernel methods have recently gained considerable attention in chemoinformatics. They offer generally good performance for problems of supervised classi...
Pierre Mahé, Jean-Philippe Vert
JDA
2008
72views more  JDA 2008»
15 years 6 months ago
Semi-local longest common subsequences in subquadratic time
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
Alexander Tiskin
180
Voted
JDA
2008
84views more  JDA 2008»
15 years 6 months ago
Red-blue covering problems and the consecutive ones property
Set Cover problems are of core importance in many applications. In recent research, the "red-blue variants" where blue elements all need to be covered whereas red elemen...
Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastia...
« Prev « First page 4447 / 4838 Last » Next »