Sciweavers

520 search results - page 53 / 104
» New Complexity Results for Classical Planning Benchmarks
Sort
View
CVPR
2004
IEEE
14 years 10 months ago
Efficient Belief Propagation for Early Vision
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher
ICAISC
2010
Springer
14 years 1 months ago
An Evolutionary Algorithm for Global Induction of Regression Trees
In the paper a new evolutionary algorithm for induction of univariate regression trees is proposed. In contrast to typical top-down approaches it globally searches for the best tre...
Marek Kretowski, Marcin Czajkowski
PQCRYPTO
2010
187views Cryptology» more  PQCRYPTO 2010»
14 years 13 days ago
Information-Set Decoding for Linear Codes over Fq
The best known non-structural attacks against code-based cryptosystems are based on information-set decoding. Stern’s algorithm and its improvements are well optimized and the co...
Christiane Peters
ISNN
2011
Springer
12 years 11 months ago
Orthogonal Feature Learning for Time Series Clustering
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
Xiaozhe Wang, Leo Lopes
WEBI
2007
Springer
14 years 2 months ago
Pairwise Constraints-Guided Non-negative Matrix Factorization for Document Clustering
Nonnegative Matrix Factorization (NMF) has been proven to be effective in text mining. However, since NMF is a well-known unsupervised components analysis technique, the existing ...
Yujiu Yang, Bao-Gang Hu