Sciweavers

4377 search results - page 191 / 876
» Mass problems and randomness
Sort
View
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 7 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
16 years 1 months ago
Resolving Identity Uncertainty with Learned Random Walks
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
Ted Sandler, Lyle H. Ungar, Koby Crammer
ICB
2009
Springer
412views Biometrics» more  ICB 2009»
16 years 1 months ago
Bayesian Face Recognition Based on Markov Random Field Modeling
In this paper, a Bayesian method for face recognition is proposed based on Markov Random Fields (MRF) modeling. Constraints on image features as well as contextual relationships be...
Rui Wang, Zhen Lei, Meng Ao, Stan Z. Li
ICC
2008
IEEE
127views Communications» more  ICC 2008»
16 years 1 months ago
On the Devolution of Large-Scale Sensor Networks in the Presence of Random Failures
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...
Fei Xing, Wenye Wang
IJCNN
2007
IEEE
16 years 26 days ago
Random Feature Subset Selection for Analysis of Data with Missing Features
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
Joseph DePasquale, Robi Polikar