Sciweavers

2194 search results - page 103 / 439
» Improving HLRTA*( k )
Sort
View
TKDD
2010
121views more  TKDD 2010»
15 years 4 days ago
Factor in the neighbors: Scalable and accurate collaborative filtering
Recommender systems provide users with personalized suggestions for products or services. These systems often rely on Collaborating Filtering (CF), where past transactions are ana...
Yehuda Koren
ICWN
2004
15 years 3 months ago
Energy-Efficient Graphical User Interface Design
Mobile computers, such as cell phones and personal digital assistants (PDAs), have dramatically increased in sophistication. At the same time, the desire of consumers for portabili...
Keith S. Vallerio, Lin Zhong, Niraj K. Jha
JEA
2006
83views more  JEA 2006»
15 years 1 months ago
Cache-Friendly implementations of transitive closure
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
Michael Penner, Viktor K. Prasanna
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
16 years 2 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
ISAAC
2003
Springer
115views Algorithms» more  ISAAC 2003»
15 years 7 months ago
A Faster Lattice Reduction Method Using Quantum Search
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
Christoph Ludwig