1095 search results - page 179 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
UAI
1996
14 years 11 months ago
1996
Two Bayesian-network structures are said to be equivalent if the set of distributions that can be represented with one of those structures is identical to the set of distributions...
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
SIGIR
2009
ACM
15 years 4 months ago
2009
ACM
We proposed and implemented a novel clustering algorithm called LAIR2, which has constant running time average for on-the-fly Scatter/Gather browsing [4]. Our experiments showed ...
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...
DAC
2005
ACM
15 years 10 months ago
2005
ACM
Trajectory methods sample the state trajectory of a circuit as it simulates in the time domain, and build macromodels by reducing and interpolating among the linearizations create...