Sciweavers

400 search results - page 47 / 80
» Subspace evasive sets
Sort
View
CP
2005
Springer
14 years 1 months ago
Using Constraint Programming for Solving Distance CSP with Uncertainty
Many problems in chemistry, robotics or molecular biology can be expressed as a Distance CSP4 . In this paper, we propose a specific methodology for tackling uncertainties in this...
Carlos Grandón, Bertrand Neveu
COCO
2008
Springer
79views Algorithms» more  COCO 2008»
13 years 9 months ago
Towards Dimension Expanders over Finite Fields
In this paper we study the problem of explicitly constructing a dimension expander raised by [BISW04]: Let Fn be the n dimensional linear space over the field F. Find a small (ide...
Zeev Dvir, Amir Shpilka
ESANN
2004
13 years 9 months ago
Face Recognition Using Recurrent High-Order Associative Memories
A novel face recognition approach is proposed, based on the use of compressed discriminative features and recurrent neural classifiers. Low-dimensional feature vectors are extract...
Iulian B. Ciocoiu
BMCBI
2008
121views more  BMCBI 2008»
13 years 7 months ago
Microarray data mining using landmark gene-guided clustering
Background: Clustering is a popular data exploration technique widely used in microarray data analysis. Most conventional clustering algorithms, however, generate only one set of ...
Pankaj Chopra, Jaewoo Kang, Jiong Yang, HyungJun C...
ICCV
2009
IEEE
15 years 20 days ago
Sparse Representation of Cast Shadows via L1-Regularized Least Squares
Scenes with cast shadows can produce complex sets of images. These images cannot be well approximated by lowdimensional linear subspaces. However, in this paper we show that the...
Xue Mei, Haibin Ling, David W. Jacobs