Sciweavers

7796 search results - page 377 / 1560
» On Generalized Schur Numbers
Sort
View
KDD
2006
ACM
165views Data Mining» more  KDD 2006»
16 years 8 months ago
Training linear SVMs in linear time
Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for highdimensional sparse data commonly encountered in applications like t...
Thorsten Joachims
KDD
2006
ACM
172views Data Mining» more  KDD 2006»
16 years 8 months ago
Attack detection in time series for recommender systems
Recent research has identified significant vulnerabilities in recommender systems. Shilling attacks, in which attackers introduce biased ratings in order to influence future recom...
Sheng Zhang, Amit Chakrabarti, James Ford, Fillia ...
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
16 years 8 months ago
Mining tree queries in a graph
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
Bart Goethals, Eveline Hoekx, Jan Van den Bussche
CHI
2008
ACM
16 years 8 months ago
Ninja cursors: using multiple cursors to assist target acquisition on large screens
We propose the "ninja cursor" to improve the performance of target acquisition, particularly on large screens. This technique uses multiple distributed cursors to reduce...
Masatomo Kobayashi, Takeo Igarashi
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
16 years 7 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...