Sciweavers

3360 search results - page 351 / 672
» Opportunistic Data Structures with Applications
Sort
View
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
16 years 7 months ago
Spectral domain-transfer learning
Traditional spectral classification has been proved to be effective in dealing with both labeled and unlabeled data when these data are from the same domain. In many real world ap...
Xiao Ling, Wenyuan Dai, Gui-Rong Xue, Qiang Yang, ...
ICFP
2006
ACM
16 years 6 months ago
A technique for generic iteration and its optimization
Software libraries rely increasingly on iterators to provide generic traversal of data structures. These iterators can be represented either as objects that maintain state or as p...
Stephen M. Watt
EUROSYS
2007
ACM
16 years 4 months ago
STMBench7: a benchmark for software transactional memory
Software transactional memory (STM) is a promising technique for controlling concurrency in modern multi-processor architectures. STM aims to be more scalable than explicit coarse...
Rachid Guerraoui, Michal Kapalka, Jan Vitek
SCALESPACE
2009
Springer
16 years 1 months ago
PDE-Driven Adaptive Morphology for Matrix Fields
Matrix fields are important in many applications since they are the adequate means to describe anisotropic behaviour in image processing models and physical measurements. A promin...
Bernhard Burgeth, Michael Breuß, Luis Pizarr...
ICDM
2008
IEEE
168views Data Mining» more  ICDM 2008»
16 years 1 months ago
Measuring Proximity on Graphs with Side Information
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
Hanghang Tong, Huiming Qu, Hani Jamjoom