Sciweavers

5138 search results - page 260 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
KDD
2009
ACM
305views Data Mining» more  KDD 2009»
16 years 7 months ago
Grocery shopping recommendations based on basket-sensitive random walk
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
Ming Li, M. Benjamin Dias, Ian H. Jarman, Wael El-...
ICC
2007
IEEE
16 years 26 days ago
Energy and Utility Optimization in Wireless Networks with Random Access
— Energy consumption is a main issue of concern in wireless networks. Energy minimization increases the time that networks’ nodes work properly without recharging or substituti...
Amir Mahdi Khodaian, Babak Hossein Khalaj
ATAL
2007
Springer
16 years 22 days ago
Conditional random fields for activity recognition
Activity recognition is a key component for creating intelligent, multi-agent systems. Intrinsically, activity recognition is a temporal classification problem. In this paper, we...
Douglas L. Vail, Manuela M. Veloso, John D. Laffer...
CIKM
2005
Springer
16 years 2 days ago
Query expansion using random walk models
It has long been recognized that capturing term relationships is an important aspect of information retrieval. Even with large amounts of data, we usually only have significant ev...
Kevyn Collins-Thompson, Jamie Callan
FOCS
1999
IEEE
15 years 11 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson