Sciweavers

444 search results - page 22 / 89
» Selectional Restrictions in HPS
Sort
View
SDM
2012
SIAM
233views Data Mining» more  SDM 2012»
12 years 7 days ago
On Finding Joint Subspace Boolean Matrix Factorizations
Finding latent factors of the data using matrix factorizations is a tried-and-tested approach in data mining. But finding shared factors over multiple matrices is more novel prob...
Pauli Miettinen
GECCO
2005
Springer
151views Optimization» more  GECCO 2005»
14 years 3 months ago
Backward-chaining genetic programming
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
Riccardo Poli, William B. Langdon
PAA
2007
13 years 9 months ago
Pairwise feature evaluation for constructing reduced representations
Feature selection methods are often used to determine a small set of informative features that guarantee good classification results. Such procedures usually consist of two compon...
Artsiom Harol, Carmen Lai, Elzbieta Pekalska, Robe...
CCS
2008
ACM
13 years 12 months ago
On spatio-temporal constraints and inheritance in role-based access control
Pervasive computing environments have created a requirement for spatial- and temporal-aware access control systems. Although temporal, spatial and spatio-temporal role-based acces...
Liang Chen, Jason Crampton
IEEESCC
2006
IEEE
14 years 3 months ago
Personalized Active Service Spaces for End-User Service Composition
End-user service composition is a promising way to ensure flexible, quick and personalized information provision and utilization, and consequently to better cope with spontaneous ...
Jun Han, Yanbo Han, Yan Jin, Jianwu Wang, Jian Yu