Sciweavers

419 search results - page 28 / 84
» Using Matrix Decompositions in Formal Concept Analysis
Sort
View
ISIM
2007
13 years 9 months ago
Formal Computation Independent Model of the Problem Domain within the MDA
The proposed approach called Topological Functioning Modeling for Model Driven Architecture (TFMfMDA) uses formal mathematical foundations of Topological Functioning Model. It intr...
Janis Osis, Erika Asnina, Andrejs Grave
SIGIR
2009
ACM
14 years 2 months ago
Fast nonparametric matrix factorization for large-scale collaborative filtering
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
Kai Yu, Shenghuo Zhu, John D. Lafferty, Yihong Gon...
HF
2007
131views more  HF 2007»
13 years 7 months ago
Formal Analysis and Automatic Generation of User Interfaces: Approach, Methodology, and an Algorithm
In this paper we propose a formal approach and methodology for analysis and generation of human-machine interfaces, with special emphasis on human-automation interaction. Our appr...
Michael Heymann, Asaf Degani
AIPS
1996
13 years 9 months ago
Event-Based Decompositions for Reasoning about External Change in Planners
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...
Jim Blythe
19
Voted
COMBINATORICS
2004
112views more  COMBINATORICS 2004»
13 years 7 months ago
Airy Phenomena and Analytic Combinatorics of Connected Graphs
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipula...
Philippe Flajolet, Bruno Salvy, Gilles Schaeffer