Sciweavers

1431 search results - page 276 / 287
» Solving Constraints in Model Transformations
Sort
View
COMPGEOM
2003
ACM
15 years 2 months ago
The smallest enclosing ball of balls: combinatorial structure and algorithms
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
Kaspar Fischer, Bernd Gärtner
CUZA
2002
130views more  CUZA 2002»
14 years 9 months ago
Distributed Threads in Java
In this paper we present a mechanism for serializing the execution-state of a distributed Java application that is implemented on a conventional Object Request Broker (ORB) archite...
Danny Weyns, Eddy Truyen, Pierre Verbaeten
CSDA
2007
169views more  CSDA 2007»
14 years 9 months ago
A null space method for over-complete blind source separation
In blind source separation, there are M sources that produce sounds independently and continuously over time. These sounds are then recorded by m receivers. The sound recorded by ...
Ray-Bing Chen, Ying Nian Wu
PE
2010
Springer
102views Optimization» more  PE 2010»
14 years 7 months ago
Extracting state-based performance metrics using asynchronous iterative techniques
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...
Douglas V. de Jager, Jeremy T. Bradley
ICML
2005
IEEE
15 years 10 months ago
Healing the relevance vector machine through augmentation
The Relevance Vector Machine (RVM) is a sparse approximate Bayesian kernel method. It provides full predictive distributions for test cases. However, the predictive uncertainties ...
Carl Edward Rasmussen, Joaquin Quiñonero Ca...