Sciweavers

2040 search results - page 74 / 408
» Approximate Expectation Maximization
Sort
View
RTCSA
2005
IEEE
15 years 5 months ago
Approximation Algorithms for Scheduling Multiple Feasible Interval Jobs
Abstract— Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible...
Jian-Jia Chen, Jun Wu, Chi-Sheng Shih, Tei-Wei Kuo
ANOR
2010
89views more  ANOR 2010»
14 years 11 months ago
Convex approximations for a class of mixed-integer recourse models
We consider mixed-integer recourse (MIR) models with a single recourse constraint. We relate the second-stage value function of such problems to the expected simple integer recour...
Maarten H. van der Vlerk
JMLR
2006
107views more  JMLR 2006»
14 years 11 months ago
Bounds for the Loss in Probability of Correct Classification Under Model Based Approximation
In many pattern recognition/classification problem the true class conditional model and class probabilities are approximated for reasons of reducing complexity and/or of statistic...
Magnus Ekdahl, Timo Koski
JDA
2008
94views more  JDA 2008»
14 years 11 months ago
Approximability of partitioning graphs with supply and demand
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Ni...
STOC
2001
ACM
139views Algorithms» more  STOC 2001»
15 years 11 months ago
Approximate distance oracles
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...
Mikkel Thorup, Uri Zwick