Sciweavers

3240 search results - page 172 / 648
» Pre-aggregation with probability distributions
Sort
View
CP
2004
Springer
15 years 9 months ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore
RTAS
2003
IEEE
15 years 9 months ago
Probabilistic Worst-Case Response-Time Analysis for the Controller Area Network
This paper presents a novel approach for calculating a probabilistic worst-case response-time for messages in the Controller Area Network (CAN). CAN uses a bit-stuffing mechanism...
Thomas Nolte, Hans Hansson, Christer Norström
SIGGRAPH
1999
ACM
15 years 8 months ago
Voice Puppetry
We introduce a method for predicting a control signal from another related signal, and apply it to voice puppetry: Generating full facial animation from expressive information in ...
Matthew Brand
CORR
2002
Springer
113views Education» more  CORR 2002»
15 years 4 months ago
Robust Global Localization Using Clustered Particle Filtering
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...
Javier Nicolás Sánchez, Adam Milstei...
TMI
1998
140views more  TMI 1998»
15 years 3 months ago
Automated Seeded Lesion Segmentation on Digital Mammograms
Abstract—Segmenting lesions is a vital step in many computerized mass-detection schemes for digital (or digitized) mammograms. We have developed two novel lesion segmentation tec...
Matthew A. Kupinski, Maryellen L. Giger