Sciweavers

360 search results - page 36 / 72
» Learning Evaluation Functions for Large Acyclic Domains
Sort
View
AAAI
2000
13 years 10 months ago
Generalizing Boundary Points
The complexity of numerical domain partitioning depends on the number of potential cut points. In multiway partitioning this dependency is often quadratic, even exponential. There...
Tapio Elomaa, Juho Rousu
PLDI
2010
ACM
14 years 1 months ago
Green: a framework for supporting energy-conscious programming using controlled approximation
Energy-efficient computing is important in several systems ranging from embedded devices to large scale data centers. Several application domains offer the opportunity to tradeof...
Woongki Baek, Trishul M. Chilimbi
EMNLP
2008
13 years 10 months ago
Word Sense Disambiguation Using OntoNotes: An Empirical Study
The accuracy of current word sense disambiguation (WSD) systems is affected by the fine-grained sense inventory of WordNet as well as a lack of training examples. Using the WSD ex...
Zhi Zhong, Hwee Tou Ng, Yee Seng Chan
CRV
2009
IEEE
115views Robotics» more  CRV 2009»
14 years 3 months ago
Learning Model Complexity in an Online Environment
In this paper we introduce the concept and method for adaptively tuning the model complexity in an online manner as more examples become available. Challenging classification pro...
Dan Levi, Shimon Ullman
IJDAR
2002
116views more  IJDAR 2002»
13 years 8 months ago
Performance evaluation of pattern classifiers for handwritten character recognition
Abstract. This paper describes a performance evaluation study in which some efficient classifiers are tested in handwritten digit recognition. The evaluated classifiers include a s...
Cheng-Lin Liu, Hiroshi Sako, Hiromichi Fujisawa