Sciweavers

354 search results - page 50 / 71
» Recovery Rate of Clustering Algorithms
Sort
View
SIGMETRICS
2011
ACM
182views Hardware» more  SIGMETRICS 2011»
14 years 6 months ago
Fine-grained latency and loss measurements in the presence of reordering
Modern trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can estimate ï¬...
Myungjin Lee, Sharon Goldberg, Ramana Rao Kompella...
ICASSP
2011
IEEE
14 years 7 months ago
Fast speaker diarization based on binary keys
Splitting a speech signal into speakers is the main goal of a speaker diarization system, which has become an important building block in many speech processing algorithms. Curren...
Xavier Anguera Miró, Jean-François B...
BMCBI
2007
149views more  BMCBI 2007»
15 years 3 months ago
A unified framework for finding differentially expressed genes from microarray experiments
Background: This paper presents a unified framework for finding differentially expressed genes (DEGs) from the microarray data. The proposed framework has three interrelated modul...
Jahangheer S. Shaik, Mohammed Yeasin
154
Voted
CVPR
2008
IEEE
16 years 5 months ago
Automatic registration of aerial imagery with untextured 3D LiDAR models
A fast 3D model reconstruction methodology is desirable in many applications such as urban planning, training, and simulations. In this paper, we develop an automated algorithm fo...
Min Ding, Kristian Lyngbaek, Avideh Zakhor
TIT
2008
110views more  TIT 2008»
15 years 3 months ago
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
Venkatesan Guruswami, Atri Rudra