Sciweavers

1651 search results - page 154 / 331
» Measuring the Complexity of Classification Problems
Sort
View
IJCAI
2007
13 years 9 months ago
Arc Consistency during Search
Enforcing arc consistency (AC) during search has proven to be a very effective method in solving Constraint Satisfaction Problems and it has been widely-used in many Constraint Pr...
Chavalit Likitvivatanavong, Yuanlin Zhang, Scott S...
HIPC
2005
Springer
14 years 1 months ago
Sensor Selection Heuristic in Sensor Networks
We consider the problem of sensor selection so as to minimise error in estimated location of target. An algorithm based on selecting a sensor in a direction in which the error is ...
Vaishali P. Sadaphal, Bijendra N. Jain
DAM
2002
67views more  DAM 2002»
13 years 7 months ago
Optimal arrangement of data in a tree directory
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
Malwina J. Luczak, Steven D. Noble
ML
2000
ACM
103views Machine Learning» more  ML 2000»
13 years 7 months ago
Nonparametric Time Series Prediction Through Adaptive Model Selection
We consider the problem of one-step ahead prediction for time series generated by an underlying stationary stochastic process obeying the condition of absolute regularity, describi...
Ron Meir
CVPR
2004
IEEE
14 years 10 months ago
Feature Selection for Classifying High-Dimensional Numerical Data
Classifying high-dimensional numerical data is a very challenging problem. In high dimensional feature spaces, the performance of supervised learning methods suffer from the curse...
Yimin Wu, Aidong Zhang