Sciweavers

316 search results - page 15 / 64
» On Approximate Majority and Probabilistic Time
Sort
View
CANPC
1998
Springer
15 years 4 months ago
Analysis of a Programmed Backoff Method for Parallel Processing on Ethernets
In many parallel processing applications, task times have relatively little variability. Accordingly, many nodes will complete a task at approximately the same time. If the applica...
Norman S. Matloff
AAAI
2000
15 years 1 months ago
Multivariate Clustering by Dynamics
We present a Bayesian clustering algorithm for multivariate time series. A clustering is regarded as a probabilistic model in which the unknown auto-correlation structure of a tim...
Marco Ramoni, Paola Sebastiani, Paul R. Cohen
QEST
2008
IEEE
15 years 6 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
ICCV
2001
IEEE
16 years 1 months ago
Continuous Global Evidence-Based Bayesian Modality Fusion for Simultaneous Tracking of Multiple Objects
Robust, real-time tracking of objects from visual data requires probabilistic fusion of multiple visual cues. Previous approaches have either been ad hoc or relied on a Bayesian n...
Jamie Sherrah, Shaogang Gong
ECIR
2007
Springer
15 years 1 months ago
Multinomial Randomness Models for Retrieval with Document Fields
Document fields, such as the title or the headings of a document, offer a way to consider the structure of documents for retrieval. Most of the proposed approaches in the literatu...
Vassilis Plachouras, Iadh Ounis