Sciweavers

2681 search results - page 263 / 537
» Problem F
Sort
View
FSS
2008
108views more  FSS 2008»
15 years 6 months ago
A collaborative recommender system based on probabilistic inference from fuzzy observations
The problem of building recommender systems has attracted considerable attention in recent years. The objective of this paper is to automatically suggest and rank a list of new it...
Luis M. de Campos, Juan M. Fernández-Luna, ...
COMBINATORICS
2006
118views more  COMBINATORICS 2006»
15 years 6 months ago
Noncrossing Trees and Noncrossing Graphs
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a...
William Y. C. Chen, Sherry H. F. Yan
ENTCS
2006
145views more  ENTCS 2006»
15 years 6 months ago
Compositionality of Security Protocols: A Research Agenda
The application of formal methods to security protocol analysis has been extensively researched during the last 25 years. Several formalisms and (semi-)automatic tools for the ver...
Cas J. F. Cremers
FUIN
2006
88views more  FUIN 2006»
15 years 6 months ago
Calculi of Approximation Spaces
This paper considers the problem of how to establish calculi of approximation spaces. Approximation spaces considered in the context of rough sets were introduced by Zdzislaw Pawla...
Andrzej Skowron, Jaroslaw Stepaniuk, James F. Pete...
JCSS
2008
80views more  JCSS 2008»
15 years 6 months ago
Improved bounds on sorting by length-weighted reversals
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
Michael A. Bender, Dongdong Ge, Simai He, Haodong ...