Sciweavers

1061 search results - page 166 / 213
» Integrity Constraints for Linked Data
Sort
View
WWW
2004
ACM
14 years 10 months ago
Dynamic assembly of learning objects
This paper describes one solution to the problem of how to select sequence, and link Web resources into a coherent, focused organization for instruction that addresses a user'...
Robert G. Farrell, Soyini D. Liburd, John C. Thoma...
SIGMETRICS
1997
ACM
153views Hardware» more  SIGMETRICS 1997»
14 years 2 months ago
Queue Management for Explicit Rate Based Congestion Control
Rate based congestion control has been considered desirable, both to deal with the high bandwidth-delay products of today's high speed networks, and to match the needs of eme...
Qingming Ma, K. K. Ramakrishnan
AAAI
2012
12 years 9 days ago
Transfer Learning in Collaborative Filtering with Uncertain Ratings
To solve the sparsity problem in collaborative filtering, researchers have introduced transfer learning as a viable approach to make use of auxiliary data. Most previous transfer...
Weike Pan, Evan Wei Xiang, Qiang Yang
SDM
2009
SIAM
193views Data Mining» more  SDM 2009»
14 years 7 months ago
Agglomerative Mean-Shift Clustering via Query Set Compression.
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
Xiaotong Yuan, Bao-Gang Hu, Ran He
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
14 years 4 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal