Sciweavers

143 search results - page 15 / 29
» Quick Approximation to Matrices and Applications
Sort
View
SIGMOD
2008
ACM
90views Database» more  SIGMOD 2008»
14 years 7 months ago
Toward best-effort information extraction
Current approaches to develop information extraction (IE) programs have largely focused on producing precise IE results. As such, they suffer from three major limitations. First, ...
Warren Shen, Pedro DeRose, Robert McCann, AnHai Do...
ICDE
2008
IEEE
129views Database» more  ICDE 2008»
14 years 9 months ago
Optimal Boolean Matrix Decomposition: Application to Role Engineering
Abstract-- A decomposition of a binary matrix into two matrices gives a set of basis vectors and their appropriate combination to form the original matrix. Such decomposition solut...
Haibing Lu, Jaideep Vaidya, Vijayalakshmi Atluri
JUCS
2007
186views more  JUCS 2007»
13 years 7 months ago
An Hybrid Fuzzy Variable Neighborhood Particle Swarm Optimization Algorithm for Solving Quadratic Assignment Problems
: Recently, Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems. A quick review of the literature reveals that re...
Hongbo Liu, Ajith Abraham
JCNS
2010
104views more  JCNS 2010»
13 years 6 months ago
A new look at state-space models for neural data
State space methods have proven indispensable in neural data analysis. However, common methods for performing inference in state-space models with non-Gaussian observations rely o...
Liam Paninski, Yashar Ahmadian, Daniel Gil Ferreir...
ICML
2005
IEEE
14 years 8 months ago
Predictive low-rank decomposition for kernel methods
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
Francis R. Bach, Michael I. Jordan