Sciweavers

6251 search results - page 235 / 1251
» Randomness, Computability, and Density
Sort
View
CSDA
2008
108views more  CSDA 2008»
15 years 4 months ago
The random Tukey depth
The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires that all possible one-dimensional projectio...
J. A. Cuesta-Albertos, A. Nieto-Reyes
DATE
2005
IEEE
144views Hardware» more  DATE 2005»
15 years 10 months ago
An Accurate SER Estimation Method Based on Propagation Probability
In this paper, we present an accurate but very fast soft error rate (SER) estimation technique for digital circuits based on error propagation probability (EPP) computation. Exper...
Ghazanfar Asadi, Mehdi Baradaran Tahoori
ICCV
2003
IEEE
16 years 6 months ago
Discriminative Random Fields: A Discriminative Framework for Contextual Interaction in Classification
In this work we present Discriminative Random Fields (DRFs), a discriminative framework for the classification of image regions by incorporating neighborhood interactions in the l...
Sanjiv Kumar, Martial Hebert
SOFSEM
2010
Springer
16 years 1 months ago
Parallel Randomized Load Balancing: A Lower Bound for a More General Model
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
Guy Even, Moti Medina
135
Voted
ICDCS
2007
IEEE
15 years 10 months ago
Differentiated Data Persistence with Priority Random Linear Codes
Both peer-to-peer and sensor networks have the fundamental characteristics of node churn and failures. Peers in P2P networks are highly dynamic, whereas sensors are not dependable...
Yunfeng Lin, Baochun Li, Ben Liang