Sciweavers

814 search results - page 47 / 163
» Machine Translation by Case Generalization
Sort
View
124
Voted
ALT
2006
Springer
15 years 11 months ago
Active Learning in the Non-realizable Case
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
Matti Kääriäinen
243
Voted
HPDC
2012
IEEE
13 years 5 months ago
vSlicer: latency-aware virtual machine scheduling via differentiated-frequency CPU slicing
Recent advances in virtualization technologies have made it feasible to host multiple virtual machines (VMs) in the same physical host and even the same CPU core, with fair share ...
Cong Xu, Sahan Gamage, Pawan N. Rao, Ardalan Kanga...
169
Voted
ALT
2009
Springer
15 years 11 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
76
Voted
CORR
2010
Springer
95views Education» more  CORR 2010»
15 years 2 months ago
Evaluating Call-By-Need on the Control Stack
Abstract. Ariola and Felleisen's call-by-need -calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substituti...
Stephen Chang, David Van Horn, Matthias Felleisen
125
Voted
COLT
2005
Springer
15 years 8 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon