3556 search results - page 575 / 712 » Can machine learning be secure |
CHI
1998
ACM
14 years 2 months ago
1998
ACM
Reading frequently involves not just looking at words on a page, but also underlining, highlighting and commenting, either on the text or in a separate notebook. This combination ...
CP
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
IJCAI
2007
14 years 2 days ago
2007
Choosing good features to represent objects can be crucial to the success of supervised machine learning algorithms. Good high-level features are those that concentrate informatio...
NIPS
2004
14 years 20 hour ago
2004
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...