Sciweavers

1529 search results - page 100 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
NIPS
2003
15 years 5 months ago
Locality Preserving Projections
Many problems in information processing involve some form of dimensionality reduction. In this paper, we introduce Locality Preserving Projections (LPP). These are linear projecti...
Xiaofei He, Partha Niyogi
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
16 years 1 months ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno
SAT
2004
Springer
131views Hardware» more  SAT 2004»
15 years 9 months ago
A Comparative Study of 2QBF Algorithms
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
Darsh P. Ranjan, Daijue Tang, Sharad Malik
PE
2000
Springer
118views Optimization» more  PE 2000»
15 years 3 months ago
A probabilistic dynamic technique for the distributed generation of very large state spaces
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
William J. Knottenbelt, Peter G. Harrison, Mark Me...
DAGM
2005
Springer
15 years 9 months ago
Regularization on Discrete Spaces
Abstract. We consider the classification problem on a finite set of objects. Some of them are labeled, and the task is to predict the labels of the remaining unlabeled ones. Such...
Dengyong Zhou, Bernhard Schölkopf