Sciweavers

340 search results - page 11 / 68
» A New Algorithm for the Construction of Optimal B-Trees
Sort
View
JC
2007
119views more  JC 2007»
13 years 7 months ago
Deterministic constructions of compressed sensing matrices
Compressed sensing is a new area of signal processing. Its goal is to minimize the number of samples that need to be taken from a signal for faithful reconstruction. The performan...
Ronald A. DeVore
IGARSS
2009
13 years 5 months ago
A Novel STAP Algorithm using Sparse Recovery Technique
A novel STAP algorithm based on sparse recovery technique, called CS-STAP, were presented. Instead of using conventional maximum likelihood estimation of covariance matrix, our met...
Ke Sun, Hao Zhang, Gang Li, Huadong Meng, Xiqin Wa...
CG
2005
Springer
13 years 7 months ago
A freehand sketching interface for progressive construction of 3D objects
This paper presents an intuitive, freehand sketching application for Computer Aided Design (CAD) that can reconstruct a 3D object from a single, flat, freehand sketch. A pen is us...
Mark Masry, Dong Joong Kang, Hod Lipson
GECCO
2008
Springer
122views Optimization» more  GECCO 2008»
13 years 8 months ago
Varying portfolio construction of stocks using genetic network programming with control nodes
A new evolutionary method named “Genetic Network Programming with Control Nodes, GNPcn” has been proposed and applied to determine the timing of buying and selling stocks. GNP...
Etsushi Ohkawa, Yan Chen, Shingo Mabu, Kaoru Shima...
CSL
2008
Springer
13 years 9 months ago
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local str...
Sven Schewe