Sciweavers

866 search results - page 111 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
ECML
2006
Springer
14 years 27 days ago
Multiple-Instance Learning Via Random Walk
This paper presents a decoupled two stage solution to the multiple-instance learning (MIL) problem. With a constructed affinity matrix to reflect the instance relations, a modified...
Dong Wang, Jianmin Li, Bo Zhang
FOIKS
2004
Springer
14 years 2 months ago
Equivalence of OLAP Dimension Schemas
Abstract. Dimension schemas are abstract models of the data hierarchies that populate OLAP warehouses. Although there is abundant work on schema equivalence in a variety of data mo...
Carlos A. Hurtado, Claudio Gutiérrez
CASES
2004
ACM
14 years 29 days ago
Scalable custom instructions identification for instruction-set extensible processors
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
Pan Yu, Tulika Mitra
EVOW
2010
Springer
14 years 1 months ago
Ant Colony Optimization for Tree Decompositions
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
Thomas Hammerl, Nysret Musliu
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
14 years 9 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy