Sciweavers

2177 search results - page 136 / 436
» Relative Margin Machines
Sort
View
ACL
2009
13 years 8 months ago
Quadratic-Time Dependency Parsing for Machine Translation
Efficiency is a prime concern in syntactic MT decoding, yet significant developments in statistical parsing with respect to asymptotic efficiency haven't yet been explored in...
Michel Galley, Christopher D. Manning
TIT
2002
72views more  TIT 2002»
13 years 9 months ago
Universal codes for finite sequences of integers drawn from a monotone distribution
We offer two noiseless codes for blocks of integers Xn = (X1, . . . , Xn). We provide explicit bounds on the relative redundancy that are valid for any distribution F in the class...
Dean P. Foster, Robert A. Stine, Abraham J. Wyner
ESA
2000
Springer
141views Algorithms» more  ESA 2000»
14 years 1 months ago
Preemptive Scheduling with Rejection
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
Han Hoogeveen, Martin Skutella, Gerhard J. Woeging...
JUCS
2010
82views more  JUCS 2010»
13 years 5 months ago
The Separation of Relativized Versions of P and DNP for the Ring of the Reals
: We consider the uniform BSS model of computation where the machines can perform additions, multiplications, and tests of the form x 0. The oracle machines can also check whether...
Christine Gaßner
ILP
2007
Springer
14 years 4 months ago
Combining Clauses with Various Precisions and Recalls to Produce Accurate Probabilistic Estimates
Statistical Relational Learning (SRL) combines the benefits of probabilistic machine learning approaches with complex, structured domains from Inductive Logic Programming (ILP). W...
Mark Goadrich, Jude W. Shavlik