Sciweavers

686 search results - page 112 / 138
» On the General Applicability of Instruction-Set Randomizatio...
Sort
View
EUROCRYPT
2004
Springer
14 years 2 months ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai
ICIP
1999
IEEE
14 years 28 days ago
Motion Segmentation with Level Sets
Segmentation of motion in an image sequence is one of the most challenging problems in image processing, while at the same time one that finds numerous applications. To date, a wea...
Abdol-Reza Mansouri, Janusz Konrad
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
14 years 16 days ago
Overlapping experiment infrastructure: more, better, faster experimentation
At Google, experimentation is practically a mantra; we evaluate almost every change that potentially affects what our users experience. Such changes include not only obvious user-...
Diane Tang, Ashish Agarwal, Deirdre O'Brien, Mike ...
CN
2007
117views more  CN 2007»
13 years 8 months ago
Cellular universal IP for nested network mobility
In recent years, network mobility (NEMO) has been studied extensively due to its potential applications in military and public transportation. NEMO basic support protocol (NBSP), ...
Patrick P. Lam, Soung C. Liew, Jack Y. B. Lee
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 8 months ago
Relative-Error CUR Matrix Decompositions
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...