Sciweavers

1414 search results - page 220 / 283
» Randomness and Universal Machines
Sort
View
ICML
2009
IEEE
14 years 10 months ago
Graph construction and b-matching for semi-supervised learning
Graph based semi-supervised learning (SSL) methods play an increasingly important role in practical machine learning systems. A crucial step in graph based SSL methods is the conv...
Tony Jebara, Jun Wang, Shih-Fu Chang
AOR
2007
107views more  AOR 2007»
13 years 10 months ago
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
Juraj Hromkovic, Tobias Mömke, Kathleen Stein...
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 10 months ago
Improved Approximations for Multiprocessor Scheduling Under Uncertainty
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T...
BMCBI
2006
158views more  BMCBI 2006»
13 years 10 months ago
Detection of non-coding RNAs on the basis of predicted secondary structure formation free energy change
Background: Non-coding RNAs (ncRNAs) have a multitude of roles in the cell, many of which remain to be discovered. However, it is difficult to detect novel ncRNAs in biochemical s...
Andrew V. Uzilov, Joshua M. Keegan, David H. Mathe...
DAC
2007
ACM
14 years 11 months ago
An Effective Guidance Strategy for Abstraction-Guided Simulation
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...
Flavio M. de Paula, Alan J. Hu