Sciweavers

1658 search results - page 163 / 332
» Learning Unknown Graphs
Sort
View
124
Voted
DATE
2007
IEEE
167views Hardware» more  DATE 2007»
15 years 8 months ago
A decomposition-based constraint optimization approach for statically scheduling task graphs with communication delays to multip
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
Nadathur Satish, Kaushik Ravindran, Kurt Keutzer
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
16 years 3 months ago
Efficiently learning the accuracy of labeling sources for selective sampling
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
116
Voted
SODA
2010
ACM
371views Algorithms» more  SODA 2010»
15 years 12 months ago
Online Learning with Queries
The online learning problem requires a player to iteratively choose an action in an unknown and changing environment. In the standard setting of this problem, the player has to ch...
Chao-Kai Chiang, Chi-Jen Lu
101
Voted
ALT
2003
Springer
15 years 11 months ago
Learning a Subclass of Regular Patterns in Polynomial Time
An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns π of the form x0α1x1 . . . α...
John Case, Sanjay Jain, Rüdiger Reischuk, Fra...
ICSM
2005
IEEE
15 years 8 months ago
Design Pattern Mining Enhanced by Machine Learning
Design patterns present good solutions to frequently occurring problems in object-oriented software design. Thus their correct application in a system’s design may significantl...
Rudolf Ferenc, Árpád Beszédes...