Sciweavers

5158 search results - page 822 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
15 years 6 months ago
Bound analysis of closed queueing networks with workload burstiness
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
TCS
2008
15 years 6 months ago
Kernel methods for learning languages
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
IVC
2007
301views more  IVC 2007»
15 years 6 months ago
Kinematic sets for real-time robust articulated object tracking
In this article a new approach is given for real-time visual tracking of a class of articulated non-rigid objects in 3D. The main contribution of this paper consists in symmetrica...
Andrew I. Comport, Éric Marchand, Fran&cced...
MOC
2002
118views more  MOC 2002»
15 years 6 months ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang
JAPLL
2007
104views more  JAPLL 2007»
15 years 6 months ago
An axiomatization of family resemblance
We invoke concepts from the theory of hypergraphs to give a measure of the closeness of family resemblance, and to make precise the idea of a composite likeness. It is shown that f...
Ray E. Jennings, Dorian X. Nicholson