Sciweavers

126 search results - page 23 / 26
» Finding low-entropy sets and trees from binary data
Sort
View
ICML
2004
IEEE
15 years 10 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
90
Voted
ALENEX
2008
180views Algorithms» more  ALENEX 2008»
14 years 11 months ago
Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing
The National Airspace System (NAS) is designed to accommodate a large number of flights over North America. For purposes of workload limitations for air traffic controllers, the a...
Amitabh Basu, Joseph S. B. Mitchell, Girishkumar S...
IPPS
2006
IEEE
15 years 3 months ago
Multiple sequence alignment by quantum genetic algorithm
In this paper we describe a new approach for the well known problem in bioinformatics: Multiple Sequence Alignment (MSA). MSA is fundamental task as it represents an essential pla...
L. Abdesslem, M. Soham, B. Mohamed
SAC
2004
ACM
15 years 2 months ago
An optimized approach for KNN text categorization using P-trees
The importance of text mining stems from the availability of huge volumes of text databases holding a wealth of valuable information that needs to be mined. Text categorization is...
Imad Rahal, William Perrizo
CIKM
2006
Springer
15 years 1 months ago
Coupling feature selection and machine learning methods for navigational query identification
It is important yet hard to identify navigational queries in Web search due to a lack of sufficient information in Web queries, which are typically very short. In this paper we st...
Yumao Lu, Fuchun Peng, Xin Li, Nawaaz Ahmed