Sciweavers

1005 search results - page 195 / 201
» Practical Secure Function Evaluation
Sort
View
ICDE
2008
IEEE
123views Database» more  ICDE 2008»
14 years 9 months ago
Handling Non-linear Polynomial Queries over Dynamic Data
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
Shetal Shah, Krithi Ramamritham
WWW
2008
ACM
14 years 8 months ago
Learning to rank relational objects and its application to web search
Learning to rank is a new statistical learning technology on creating a ranking model for sorting objects. The technology has been successfully applied to web search, and is becom...
Tao Qin, Tie-Yan Liu, Xu-Dong Zhang, De-Sheng Wang...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
EUROSYS
2007
ACM
14 years 4 months ago
Exploiting nonstationarity for performance prediction
Real production applications ranging from enterprise applications to large e-commerce sites share a crucial but seldom-noted characteristic: The relative frequencies of transactio...
Christopher Stewart, Terence Kelly, Alex Zhang
RECOMB
2009
Springer
14 years 2 months ago
Protein Fragment Swapping: A Method for Asymmetric, Selective Site-Directed Recombination
This paper presents a new approach to site-directed recombination, swapping combinations of selected discontiguous fragments from a source protein in place of corresponding fragmen...
Wei Zheng, Karl E. Griswold, Chris Bailey-Kellogg