Sciweavers

520 search results - page 7 / 104
» Reductions Between Expansion Problems
Sort
View
STACS
1995
Springer
13 years 11 months ago
Generalized Scans and Tri-Diagonal Systems
Motivatedby the analysis of known parallel techniques for the solution of linear tridiagonal system, we introduce generalized scans, a class of recursively de ned lengthpreserving...
Paul F. Fischer, Franco P. Preparata, John E. Sava...
SIAMSC
2010
142views more  SIAMSC 2010»
13 years 2 months ago
Efficient Spectral Sparse Grid Methods and Applications to High-Dimensional Elliptic Problems
Abstract. We develop in this paper some efficient algorithms which are essential to implementations of spectral methods on the sparse grid by Smolyak's construction based on a...
Jie Shen, Haijun Yu
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 7 months ago
Expansion and Search in Networks
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
Arun S. Maiya, Tanya Y. Berger-Wolf
NIPS
2008
13 years 9 months ago
Learning with Consistency between Inductive Functions and Kernels
Regularized Least Squares (RLS) algorithms have the ability to avoid over-fitting problems and to express solutions as kernel expansions. However, we observe that the current RLS ...
Haixuan Yang, Irwin King, Michael R. Lyu
CIKM
2007
Springer
14 years 1 months ago
Extending query translation to cross-language query expansion with markov chain models
Dictionary-based approaches to query translation have been widely used in Cross-Language Information Retrieval (CLIR) experiments. Using these approaches, translation has been not...
Guihong Cao, Jianfeng Gao, Jian-Yun Nie, Jing Bai