Sciweavers

1236 search results - page 84 / 248
» On the Hamkins approximation property
Sort
View
AAAI
2010
15 years 2 months ago
Stability and Incentive Compatibility in a Kernel-Based Combinatorial Auction
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...
Sébastien Lahaie
93
Voted
NIPS
2003
15 years 2 months ago
Applying Metric-Trees to Belief-Point POMDPs
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
98
Voted
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 27 days ago
Descent methods for Nonnegative Matrix Factorization
In this paper, we present several descent methods that can be applied to nonnegative matrix factorization and we analyze a recently developped fast block coordinate method. We als...
Ngoc-Diep Ho, Paul Van Dooren, Vincent D. Blondel
IJFCS
2006
70views more  IJFCS 2006»
15 years 24 days ago
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
80
Voted
JSAC
2008
70views more  JSAC 2008»
15 years 24 days ago
LMMSE turbo equalization based on factor graphs
Abstract--In this paper, a vector-form factor graph representation is derived for intersymbol interference (ISI) channels. The resultant graphs have a tree-structure that avoids th...
Qinghua Guo, Li Ping