Sciweavers

780 search results - page 30 / 156
» Robustness and Randomness
Sort
View
ICCS
2005
Springer
14 years 2 months ago
Highly Scalable Algorithms for Robust String Barcoding
: String barcoding is a recently introduced technique for genomic based identification of microorganisms. In this paper we describe the engineering of highly scalable algorithms fo...
Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoi...
PAMI
1998
124views more  PAMI 1998»
13 years 8 months ago
Robust Adaptive Segmentation of Range Images
—We propose a novel image segmentation technique using the robust, adaptive least kth order squares (ALKS) estimator which minimizes the kth order statistics of the squared of re...
Kil-Moo Lee, Peter Meer, Rae-Hong Park
JAIR
2007
95views more  JAIR 2007»
13 years 8 months ago
Consistency and Random Constraint Satisfaction Models
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
Yong Gao, Joseph C. Culberson
IPPS
2006
IEEE
14 years 2 months ago
Load balancing in the presence of random node failure and recovery
In many distributed computing systems that are prone to either induced or spontaneous node failures, the number of available computing resources is dynamically changing in a rando...
Sagar Dhakal, Majeed M. Hayat, Jorge E. Pezoa, Cha...
INFOCOM
2006
IEEE
14 years 2 months ago
On Heterogeneous Overlay Construction and Random Node Selection in Unstructured P2P Networks
— Unstructured p2p and overlay network applications often require that a random graph be constructed, and that some form of random node selection take place over that graph. A ke...
Vivek Vishnumurthy, Paul Francis