Sciweavers

3250 search results - page 298 / 650
» An Algorithm to Solve a Linear Program
Sort
View
ICDM
2007
IEEE
166views Data Mining» more  ICDM 2007»
16 years 29 days ago
Mining Statistical Information of Frequent Fault-Tolerant Patterns in Transactional Databases
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of...
Ardian Kristanto Poernomo, Vivekanand Gopalkrishna...
SIAMCO
2002
121views more  SIAMCO 2002»
15 years 6 months ago
Consistent Approximations and Approximate Functions and Gradients in Optimal Control
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
Olivier Pironneau, Elijah Polak
GECCO
2007
Springer
212views Optimization» more  GECCO 2007»
16 years 24 days ago
A developmental model of neural computation using cartesian genetic programming
The brain has long been seen as a powerful analogy from which novel computational techniques could be devised. However, most artificial neural network approaches have ignored the...
Gul Muhammad Khan, Julian F. Miller, David M. Hall...
ICASSP
2011
IEEE
14 years 10 months ago
Basis Pursuit in sensor networks
Basis Pursuit (BP) finds a minimum ℓ1-norm vector z that satisfies the underdetermined linear system Mz = b, where the matrix M and vector b are given. Lately, BP has attracte...
João F. C. Mota, João M. F. Xavier, ...
JMLR
2012
13 years 9 months ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
Eftychios A. Pnevmatikakis, Liam Paninski