2157 search results - page 67 / 432 » Binary ant algorithm |
TKDE
2002
15 years 15 hour ago
2002
We consider the problem of finding a set of attribute values that give a high quality binary segmentation of a database. The quality of a segmentation is defined by an objective fu...
VLDB
1998
ACM
15 years 4 months ago
1998
ACM
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
IJAR
2008
15 years 12 days ago
2008
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...
139
click to vote
ALGORITHMICA
2011
14 years 7 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
101
click to vote
MICCAI
2001
Springer
15 years 4 months ago
2001
Springer
Assessment of normal and abnormal anatomical variability requires a coordinate system enabling inter-subject comparison. We present a binary minimum entropy criterion to assess af...