Sciweavers

160 search results - page 12 / 32
» Approximability of Manipulating Elections
Sort
View
ICML
2009
IEEE
14 years 10 months ago
Approximate inference for planning in stochastic relational worlds
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
Tobias Lang, Marc Toussaint
IAAI
2003
13 years 11 months ago
LAW: A Workbench for Approximate Pattern Matching in Relational Data
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
Michael Wolverton, Pauline Berry, Ian W. Harrison,...
TSP
2011
96views more  TSP 2011»
13 years 4 months ago
A Signal Processing Approach to Fourier Analysis of Ranking Data: The Importance of Phase
—Ranking data is a type of data obtained in some elections, in customer surveys, as well as from web search results. Such data may be considered as a type of signal defined on t...
Ramakrishna Kakarala
SIAMMAX
2011
141views more  SIAMMAX 2011»
13 years 14 days ago
Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
Higher-order tensors are used in many application fields, such as statistics, signal processing, and scientific computing. Efficient and reliable algorithms for manipulating thes...
Mariya Ishteva, Pierre-Antoine Absil, Sabine Van H...
ISSAC
2007
Springer
153views Mathematics» more  ISSAC 2007»
14 years 3 months ago
On exact and approximate interpolation of sparse rational functions
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
Erich Kaltofen, Zhengfeng Yang