Sciweavers

950 search results - page 38 / 190
» Modified global k
Sort
View
EMNLP
2006
15 years 6 months ago
Semantic Role Labeling via Instance-Based Learning
This paper demonstrates two methods to improve the performance of instancebased learning (IBL) algorithms for the problem of Semantic Role Labeling (SRL). Two IBL algorithms are u...
Chi-san Althon Lin, Tony C. Smith
ENTCS
2006
134views more  ENTCS 2006»
15 years 5 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening
MOC
2000
74views more  MOC 2000»
15 years 5 months ago
Computing the tame kernel of quadratic imaginary fields
J. Tate has determined the group K2OF (called the tame kernel) for six quadratic imaginary number fields F = Q( d), where d = -3, -4, -7, -8, -11, -15. Modifying the method of Tat...
Jerzy Browkin, Karim Belabas, Herbert Gangl
CVPR
1998
IEEE
16 years 7 months ago
Nonlinear PHMMs for the Interpretation of Parameterized Gesture
In previous work [14], we modify the hidden Markov model (HMM) framework to incorporate a global parametric variation in the output probabilities of the states of the HMM. Develop...
Andrew D. Wilson, Aaron F. Bobick
SIAMNUM
2011
108views more  SIAMNUM 2011»
15 years 4 days ago
A Mixed Method for the Biharmonic Problem Based On a System of First-Order Equations
We introduce a new mixed method for the biharmonic problem. The method is based on a formulation where the biharmonic problem is re-written as a system of four first-order equatio...
Edwin M. Behrens, Johnny Guzmán