Sciweavers

3360 search results - page 354 / 672
» Opportunistic Data Structures with Applications
Sort
View
AAAI
2010
15 years 8 months ago
G-Optimal Design with Laplacian Regularization
In many real world applications, labeled data are usually expensive to get, while there may be a large amount of unlabeled data. To reduce the labeling cost, active learning attem...
Chun Chen, Zhengguang Chen, Jiajun Bu, Can Wang, L...
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 11 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
SIAMSC
2011
85views more  SIAMSC 2011»
14 years 9 months ago
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
Abstract. Adaptive multiscale methods are among the many effective techniques for the numerical solution of partial differential equations. Efficient grid management is an import...
Kolja Brix, Ralf Massjung, Alexander Voss
SDM
2012
SIAM
305views Data Mining» more  SDM 2012»
13 years 9 months ago
Learning Hierarchical Relationships among Partially Ordered Objects with Heterogeneous Attributes and Links
Objects linking with many other objects in an information network may imply various semantic relationships. Uncovering such knowledge is essential for role discovery, data cleanin...
Chi Wang, Jiawei Han, Qi Li, Xiang Li, Wen-Pin Lin...
SEMCO
2008
IEEE
16 years 1 months ago
SEMSOC: SEMantic, SOcial and Content-Based Clustering in Multimedia Collaborative Tagging Systems
A huge amount of data and metadata emerges from Web 2.0 applications which have transformed the Web to a mass social interaction and collaboration medium. Collaborative Tagging Sy...
Eirini Giannakidou, Ioannis Kompatsiaris, Athena V...