364 search results - page 37 / 73 » Generalized normal forms and polynomial system solving |
67
Voted
CPM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
101
click to vote
JAIR
2010
14 years 4 months ago
2010
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of ...
VALUETOOLS
2006
ACM
15 years 3 months ago
2006
ACM
We present a new approximation method called value extrapolation for Markov processes with large or infinite state spaces. The method can be applied for calculating any performan...
113
click to vote
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
WIDM
2004
ACM
15 years 3 months ago
2004
ACM
In this paper, we propose a new approach to automatically clustering e-commerce search engines (ESEs) on the Web such that ESEs in the same cluster sell similar products. This all...