Sciweavers

660 search results - page 71 / 132
» Improving AOR method for consistent linear systems
Sort
View
SDM
2007
SIAM
130views Data Mining» more  SDM 2007»
15 years 1 months ago
Towards Attack-Resilient Geometric Data Perturbation
Data perturbation is a popular technique for privacypreserving data mining. The major challenge of data perturbation is balancing privacy protection and data quality, which are no...
Keke Chen, Gordon Sun, Ling Liu
HICSS
2003
IEEE
131views Biometrics» more  HICSS 2003»
15 years 5 months ago
Requirements Elicitation and Elicitation Technique Selection: A Model for Two Knowledge-Intensive Software Development Processes
By its very nature, software development consists of many knowledge-intensive processes. One of the most difficult to model, however, is requirements elicitation. This paper prese...
Ann M. Hickey, Alan M. Davis
FPL
2008
Springer
120views Hardware» more  FPL 2008»
15 years 1 months ago
An FPGA-based implementation of the MINRES algorithm
Due to continuous improvements in the resources available on FPGAs, it is becoming increasingly possible to accelerate floating point algorithms. The solution of a system of linea...
David Boland, George A. Constantinides
CORR
2010
Springer
127views Education» more  CORR 2010»
14 years 12 months ago
Analysis of Basis Pursuit Via Capacity Sets
Finding the sparsest solution for an under-determined linear system of equations D = s is of interest in many applications. This problem is known to be NP-hard. Recent work studie...
Joseph Shtok, Michael Elad
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
15 years 5 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert