5153 search results - page 612 / 1031 » Introduction to Randomized Algorithms |
204
click to vote
GECCO
2009
Springer
16 years 24 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
141
click to vote
RECSYS
2009
ACM
16 years 23 days ago
2009
ACM
A fundamental aspect of rating-based recommender systems is the observation process, the process by which users choose the items they rate. Nearly all research on collaborative ï¬...
173
click to vote
SIGIR
2009
ACM
16 years 23 days ago
2009
ACM
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
170
click to vote
CISS
2008
IEEE
16 years 22 days ago
2008
IEEE
Abstract—Compressive sensing is a new signal acquisition technology with the potential to reduce the number of measurements required to acquire signals that are sparse or compres...
139
click to vote
HOST
2008
IEEE
16 years 21 days ago
2008
IEEE
—Masking is a side-channel countermeasure that randomizes side-channel leakage, such as the power dissipation of a circuit. Masking is only effective on the condition that the in...