Sciweavers

11740 search results - page 428 / 2348
» More Problems in Rewriting
Sort
View
NIPS
2007
15 years 8 months ago
The Generalized FITC Approximation
We present an efficient generalization of the sparse pseudo-input Gaussian process (SPGP) model developed by Snelson and Ghahramani [1], applying it to binary classification pro...
Andrew Naish-Guzman, Sean B. Holden
PTS
2007
106views Hardware» more  PTS 2007»
15 years 8 months ago
A New Method for Interoperability Test Generation
Interoperability testing aims at verifying the possibility for two or more components to communicate correctly while providing the foreseen services. In this paper, we describe a n...
Alexandra Desmoulin, César Viho
CATS
2006
15 years 8 months ago
Combinatorial Generation by Fusing Loopless Algorithms
Some combinatorial generation problems can be broken into subproblems for which loopless algorithms already exist. We discuss means by which loopless algorithms can be fused to pr...
Tadao Takaoka, Stephen Violich
ECIS
2001
15 years 8 months ago
Applicability of HCI research to e government applications
This paper gives an overview of the state of the art in the field of HCI (Human-Computer Interaction) and investigates the applicability of HCI research to the development of larg...
Felix Kossak, Wolfgang Eßmayr, Werner Winiwa...
IJCAI
2001
15 years 8 months ago
Dynamic Control Of Plans With Temporal Uncertainty
Certain planning systems that deal with quantitative time constraints have used an underlying Simple Temporal Problem solver to ensure temporal consistency of plans. However, many...
Paul H. Morris, Nicola Muscettola, Thierry Vidal