Sciweavers

552 search results - page 90 / 111
» Observable Graphs
Sort
View
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 8 months ago
Loop corrections for approximate inference
We propose a method to improve approximate inference methods by correcting for the influence of loops in the graphical model. The method is a generalization and alternative implem...
Joris M. Mooij, Bert Kappen
JCO
2006
126views more  JCO 2006»
13 years 7 months ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...
NRHM
2008
106views more  NRHM 2008»
13 years 7 months ago
Towards the unification of formats for overlapping markup
Overlapping markup refers to the issue of how to represent data structures more expressive than trees--for example direct acyclic graphs--using markup (meta-)languages which have ...
Paolo Marinelli, Fabio Vitali, Stefano Zacchiroli
SMA
2008
ACM
173views Solid Modeling» more  SMA 2008»
13 years 7 months ago
Visibility-based feature extraction from discrete models
In this paper, we present a new visibility-based feature extraction algorithm from discrete models as dense point clouds resulting from laser scans. Based on the observation that ...
Antoni Chica
TSI
2008
129views more  TSI 2008»
13 years 7 months ago
COSMOS, composition de noeuds de contexte
Ubiquitous applications are facing a large diversity of execution contexts. However, this diversity requires some continual adaptation to preserve the correct execution of these ap...
Denis Conan, Romain Rouvoy, Lionel Seinturier