Sciweavers

125 search results - page 10 / 25
» Rapid Learning for Binary Programs
Sort
View
CCS
2007
ACM
14 years 2 months ago
Privacy-preserving remote diagnostics
We present an efficient protocol for privacy-preserving evaluation of diagnostic programs, represented as binary decision trees or branching programs. The protocol applies a bran...
Justin Brickell, Donald E. Porter, Vitaly Shmatiko...
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 8 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
KDD
2009
ACM
175views Data Mining» more  KDD 2009»
14 years 14 days ago
Multi-class protein fold recognition using large margin logic based divide and conquer learning
Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an...
Huma Lodhi, Stephen Muggleton, Michael J. E. Stern...
CAL
2006
13 years 8 months ago
A Case for Compressing Traces with BDDs
Instruction-level traces are widely used for program and hardware analysis. However, program traces for just a few seconds of execution are enormous, up to several terabytes in siz...
Graham D. Price, Manish Vachharajani
ICTAI
2003
IEEE
14 years 1 months ago
Interactive Open Architecture Computer Vision
In this paper, design and implementation of an interactive open architecture computer vision software package called Ch OpenCV is presented. Benefiting from both Ch and OpenCV, C...
Qingcang Yu, Harry H. Cheng, Wayne W. Cheng, Xiaod...