Sciweavers

2477 search results - page 63 / 496
» Approximate extended formulations
Sort
View
EACL
2006
ACL Anthology
13 years 11 months ago
Online Learning of Approximate Dependency Parsing Algorithms
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
Ryan T. McDonald, Fernando C. N. Pereira
WSC
2004
13 years 11 months ago
Approximate Time-Parallel Cache Simulation
In time-parallel simulation, the simulation time axis is decomposed into a number of slices which are assigned to parallel processes for concurrent simulation. Although a promisin...
Tobias Kiesling
CORR
2006
Springer
80views Education» more  CORR 2006»
13 years 9 months ago
A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs
We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided ...
Shmuel Friedland, Daniel Levy
CSDA
2007
134views more  CSDA 2007»
13 years 9 months ago
Variational approximations in Bayesian model selection for finite mixture distributions
Variational methods for model comparison have become popular in the neural computing/machine learning literature. In this paper we explore their application to the Bayesian analys...
Clare A. McGrory, D. M. Titterington
ESA
2011
Springer
251views Algorithms» more  ESA 2011»
12 years 9 months ago
Improved Approximation Algorithms for Bipartite Correlation Clustering
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke...