Sciweavers

635 search results - page 63 / 127
» Some Computational Problems Related to Pseudo-intents
Sort
View
CVPR
2005
IEEE
15 years 11 months ago
A Weighted Nearest Mean Classifier for Sparse Subspaces
In this paper we focus on high dimensional data sets for which the number of dimensions is an order of magnitude higher than the number of objects. From a classifier design standp...
Cor J. Veenman, David M. J. Tax
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
15 years 10 months ago
One-dimensional quantum walks
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin V...
PPSN
2004
Springer
15 years 3 months ago
Dominance Based Crossover Operator for Evolutionary Multi-objective Algorithms
In spite of the recent quick growth of the Evolutionary Multi-objective Optimization (EMO) research field, there has been few trials to adapt the general variation operators to t...
Olga Rudenko, Marc Schoenauer
JEA
2006
90views more  JEA 2006»
14 years 9 months ago
Heuristics for estimating contact area of supports in layered manufacturing
Layered Manufacturing is a technology that allows physical prototypes of three-dimensional models to be built directly from their digital representation, as a stack of two-dimensi...
Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid,...
SLSFS
2005
Springer
15 years 3 months ago
Incorporating Constraints and Prior Knowledge into Factorization Algorithms - An Application to 3D Recovery
Abstract. Matrix factorization is a fundamental building block in many computer vision and machine learning algorithms. In this work we focus on the problem of ”structure from mo...
Amit Gruber, Yair Weiss