Sciweavers

3250 search results - page 350 / 650
» An Algorithm to Solve a Linear Program
Sort
View
ACL
1994
15 years 8 months ago
Precise N-Gram Probabilities from Stochastic Context-Free Grammars
We present an algorithm for computing n-gram probabilities from stochastic context-free grammars, a procedure that can alleviate some of the standard problems associated with n-gr...
Andreas Stolcke, Jonathan Segal
ICDM
2006
IEEE
108views Data Mining» more  ICDM 2006»
16 years 21 days ago
Minimum Enclosing Spheres Formulations for Support Vector Ordinal Regression
We present two new support vector approaches for ordinal regression. These approaches find the concentric spheres with minimum volume that contain most of the training samples. B...
Shirish Krishnaj Shevade, Wei Chu
DATE
2003
IEEE
95views Hardware» more  DATE 2003»
15 years 12 months ago
A New Simulation Technique for Periodic Small-Signal Analysis
A new numerical technique for periodic small signal analysis based on harmonic balance method is proposed. Special-purpose numerical procedures based on Krylov subspace methods ar...
Mark M. Gourary, Sergey G. Rusakov, Sergey L. Ulya...
SIGECOM
2005
ACM
97views ECommerce» more  SIGECOM 2005»
16 years 6 days ago
Complexity of (iterated) dominance
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Vincent Conitzer, Tuomas Sandholm
PLDI
1997
ACM
15 years 11 months ago
Componential Set-Based Analysis
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
Cormac Flanagan, Matthias Felleisen