Sciweavers

4007 search results - page 296 / 802
» Computation with imprecise probabilities
Sort
View
PE
2000
Springer
118views Optimization» more  PE 2000»
15 years 4 months ago
A probabilistic dynamic technique for the distributed generation of very large state spaces
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
William J. Knottenbelt, Peter G. Harrison, Mark Me...
JCB
1998
105views more  JCB 1998»
15 years 4 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou
TSC
2008
140views more  TSC 2008»
15 years 4 months ago
Dynamic Web Service Selection for Reliable Web Service Composition
This paper studies the dynamic Web service selection problem in a failure-prone environment, which aims to determine a subset of Web services to be invoked at runtime so as to succ...
San-Yih Hwang, Ee-Peng Lim, Chien-Hsiang Lee, Chen...
TKDE
2010
251views more  TKDE 2010»
15 years 3 months ago
Clustering Uncertain Data Using Voronoi Diagrams and R-Tree Index
—We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises...
Ben Kao, Sau Dan Lee, Foris K. F. Lee, David Wai-L...
BMVC
2010
15 years 2 months ago
On-line Adaption of Class-specific Codebooks for Instance Tracking
Off-line trained class-specific object detectors are designed to detect any instance of the class in a given image or video sequence. In the context of object tracking, however, o...
Juergen Gall, Nima Razavi, Luc J. Van Gool