719 search results - page 69 / 144 » Adaptive Online Time Allocation to Search Algorithms |
103
click to vote
WWW
2005
ACM
15 years 10 months ago
2005
ACM
According to a recent survey made by Nielsen NetRatings, searching on news articles is one of the most important activity online. Indeed, Google, Yahoo, MSN and many others have p...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Recent research has identified significant vulnerabilities in recommender systems. Shilling attacks, in which attackers introduce biased ratings in order to influence future recom...
AUSAI
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
ICA
2010
Springer
14 years 11 months ago
2010
Springer
In this paper, we propose a novel method for blind source separation (BSS) based on time-frequency sparseness (TF) that can estimate the number of sources and time-frequency masks,...
172
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
We address the problem of executing continuous multiway join queries in unpredictable and volatile environments. Our query class captures windowed join queries in data stream syst...