5115 search results - page 711 / 1023 » On Randomized Lanczos Algorithms |
171
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
It has been widely recognized that the dynamic range information of an application can be exploited to reduce the datapath bitwidth of either processors or ASICs, and therefore th...
158
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Clustering data in high dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by proje...
193
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Many robot control problems of practical importance, including operational space control, can be reformulated as immediate reward reinforcement learning problems. However, few of ...
157
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
In the sponsored search model, search engines are paid by businesses that are interested in displaying ads for their site alongside the search results. Businesses bid for keywords...
155
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...