Sciweavers

2376 search results - page 355 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 10 months ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...
DKE
2007
119views more  DKE 2007»
13 years 10 months ago
Association rules mining using heavy itemsets
A well-known problem that limits the practical usage of association rule mining algorithms is the extremely large number of rules generated. Such a large number of rules makes the...
Girish Keshav Palshikar, Mandar S. Kale, Manoj M. ...
SPE
2008
108views more  SPE 2008»
13 years 10 months ago
Effective asymmetric XML compression
The innate verbosity of the Extensible Markup Language remains one of its main weaknesses, especially when large XML documents are concerned. This problem can be solved with the a...
Przemyslaw Skibinski, Szymon Grabowski, Jakub Swac...
TCSV
2008
153views more  TCSV 2008»
13 years 10 months ago
Broadcast Court-Net Sports Video Analysis Using Fast 3-D Camera Modeling
This paper addresses the automatic analysis of court-net sports video content. We extract information about the players, the playing-field in a bottom-up way until we reach scene-l...
Jungong Han, Dirk Farin, Peter H. N. de With
TON
2008
125views more  TON 2008»
13 years 10 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni