2111 search results - page 311 / 423 » An Approach to Software Testing of Machine Learning Applicat... |
120
Voted
ACMSE
2006
ACM
15 years 9 months ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
129
Voted
KDD
2006
ACM
16 years 3 months ago
2006
ACM
Collaborative recommender systems are highly vulnerable to attack. Attackers can use automated means to inject a large number of biased profiles into such a system, resulting in r...
139
Voted
SIGIR
2010
ACM
15 years 7 months ago
2010
ACM
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
135
click to vote
SETP
2007
15 years 4 months ago
2007
Requirement analysis continues to be one of the most critical and challenging phases during the software development process. Many object-oriented methodologies identify three pri...
143
Voted
FLAIRS
2010
15 years 5 months ago
2010
Nowadays, graph-based knowledge discovery algorithms do not consider numeric attributes (they are discarded in the preprocessing step, or they are treated as alphanumeric values w...