Sciweavers

5962 search results - page 99 / 1193
» Efficient Clustering for Orders
Sort
View
AMC
2008
106views more  AMC 2008»
15 years 6 months ago
A non-binary constraint ordering heuristic for constraint satisfaction problems
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
Miguel A. Salido
ISMIS
2000
Springer
15 years 10 months ago
Top-Down Query Processing in First Order Deductive Databases under the DWFS
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
C. A. Johnson
PRL
2010
188views more  PRL 2010»
15 years 1 months ago
A fast divisive clustering algorithm using an improved discrete particle swarm optimizer
As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive cl...
Liang Feng, Ming-Hui Qiu, Yu-Xuan Wang, Qiao-Liang...
NECO
2008
112views more  NECO 2008»
15 years 6 months ago
Second-Order SMO Improves SVM Online and Active Learning
Iterative learning algorithms that approximate the solution of support vector machines (SVMs) have two potential advantages. First, they allow for online and active learning. Seco...
Tobias Glasmachers, Christian Igel
JMLR
2010
111views more  JMLR 2010»
15 years 1 months ago
An EM Algorithm on BDDs with Order Encoding for Logic-based Probabilistic Models
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...
Masakazu Ishihata, Yoshitaka Kameya, Taisuke Sato,...