Sciweavers

1223 search results - page 167 / 245
» An Attributive Logic of Set Descriptions and Set Operations
Sort
View
STACS
1994
Springer
15 years 4 months ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman
IDA
2002
Springer
14 years 11 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
AMAI
2007
Springer
15 years 1 days ago
Relational concept discovery in structured datasets
Relational datasets, i.e., datasets in which individuals are described both by their own features and by their relations to other individuals, arise from various sources such as d...
Marianne Huchard, Mohamed Rouane Hacene, Cyril Rou...
SAC
2008
ACM
14 years 11 months ago
Tag-aware recommender systems by fusion of collaborative filtering algorithms
Recommender Systems (RS) aim at predicting items or ratings of items that the user are interested in. Collaborative Filtering (CF) algorithms such as user- and item-based methods ...
Karen H. L. Tso-Sutter, Leandro Balby Marinho, Lar...
JAR
2006
236views more  JAR 2006»
14 years 12 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard