Sciweavers

3250 search results - page 4 / 650
» Parameterized Learning Complexity
Sort
View
TAMC
2009
Springer
14 years 3 months ago
On Parameterized Exponential Time Complexity
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
Jianer Chen, Iyad A. Kanj, Ge Xia
IJIT
2004
13 years 10 months ago
Learning of Class Membership Values by Ellipsoidal Decision Regions
A novel method of learning complex fuzzy decision regions in the n-dimensional feature space is proposed. Through the fuzzy decision regions, a given pattern's class membershi...
Leehter Yao, Chin-chin Lin
APAL
2006
94views more  APAL 2006»
13 years 8 months ago
Parameterized counting problems
Parameterized complexity has, so far, been largely con ned to consideration of computational problems as decision or search problems. However, it is becoming evident that the param...
Catherine McCartin
EDUTAINMENT
2010
Springer
13 years 9 months ago
Sketch-Based Instancing of Parameterized 3D Models
Dan Xiao, Zhigeng Pan, Renzhong Zhou