Sciweavers

390 search results - page 60 / 78
» Using Temporal Data for Making Recommendations
Sort
View
COMPGEOM
2004
ACM
15 years 2 months ago
The corner arc algorithm
In a landmark survey of visibility algorithms in 1974, Sutherland, Sproull, and Schumacker stated that “We believe the principal untapped source of help for hidden surface algor...
Olaf A. Hall-Holt
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
15 years 10 months ago
Web usage mining based on probabilistic latent semantic analysis
The primary goal of Web usage mining is the discovery of patterns in the navigational behavior of Web users. Standard approaches, such as clustering of user sessions and discoveri...
Xin Jin, Yanzan Zhou, Bamshad Mobasher
LCN
2003
IEEE
15 years 2 months ago
Scheduling Nodes in Wireless Sensor Networks: A Voronoi Approach
A wireless sensor network is a special kind of ad-hoc network with distributed sensing and processing capability that can be used in a wide range of applications, such as environm...
Marcos Augusto M. Vieira, Luiz Filipe M. Vieira, L...
ATAL
2007
Springer
15 years 3 months ago
Batch reinforcement learning in a complex domain
Temporal difference reinforcement learning algorithms are perfectly suited to autonomous agents because they learn directly from an agent’s experience based on sequential actio...
Shivaram Kalyanakrishnan, Peter Stone
ICDE
2004
IEEE
179views Database» more  ICDE 2004»
15 years 11 months ago
CrossMine: Efficient Classification Across Multiple Database Relations
Most of today's structured data is stored in relational databases. Such a database consists of multiple relations which are linked together conceptually via entity-relationsh...
Xiaoxin Yin, Jiawei Han, Jiong Yang, Philip S. Yu