Sciweavers

1095 search results - page 130 / 219
» Preprocessing of Intractable Problems
Sort
View
AI
2002
Springer
13 years 10 months ago
Learning cost-sensitive active classifiers
Most classification algorithms are "passive", in that they assign a class label to each instance based only on the description given, even if that description is incompl...
Russell Greiner, Adam J. Grove, Dan Roth
BIOINFORMATICS
2002
100views more  BIOINFORMATICS 2002»
13 years 10 months ago
Optimal algorithms for local vertex quartet cleaning
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary...
Gianluca Della Vedova, Todd Wareham
ENTCS
2007
145views more  ENTCS 2007»
13 years 10 months ago
Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks
Wireless sensor networks are comprised of a vast number of ultra-small autonomous computing, communication and sensing devices, with restricted energy and computing capabilities, ...
Ioannis Chatzigiannakis, Elisavet Konstantinou, Va...
ML
2007
ACM
106views Machine Learning» more  ML 2007»
13 years 9 months ago
Surrogate maximization/minimization algorithms and extensions
Abstract Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. A...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung
IJRR
2010
162views more  IJRR 2010»
13 years 8 months ago
Planning under Uncertainty for Robotic Tasks with Mixed Observability
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for robot motion planning in uncertain and dynamic environments. They have been app...
Sylvie C. W. Ong, Shao Wei Png, David Hsu, Wee Sun...