Sciweavers

1993 search results - page 208 / 399
» Analysis of the Effectiveness of G3PARM Algorithm
Sort
View
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
16 years 1 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
ICDE
2010
IEEE
199views Database» more  ICDE 2010»
15 years 11 months ago
Mining mutation chains in biological sequences
— The increasing infectious disease outbreaks has led to a need for new research to better understand the disease’s origins, epidemiological features and pathogenicity caused b...
Chang Sheng, Wynne Hsu, Mong-Li Lee, Joo Chuan Ton...
CAIP
2009
Springer
200views Image Analysis» more  CAIP 2009»
15 years 11 months ago
Real-Time Stereo Vision: Making More Out of Dynamic Programming
Abstract. Dynamic Programming (DP) is a popular and efficient method for calculating disparity maps from stereo images. It allows for meeting real-time constraints even on low-cos...
Jan Salmen, Marc Schlipsing, Johann Edelbrunner, S...
151
Voted
ISLPED
2009
ACM
125views Hardware» more  ISLPED 2009»
15 years 11 months ago
Behavior-level observability don't-cares and application to low-power behavioral synthesis
Many techniques for power management employed in advanced RTL synthesis tools rely explicitly or implicitly on observability don’t-care (ODC) conditions. In this paper we presen...
Jason Cong, Bin Liu, Zhiru Zhang
ISBI
2007
IEEE
15 years 11 months ago
Generalized K-T Blast and K-T Sense Using Focuss
According to the recent theory of compressed sensing, accurate reconstruction is possible even from data samples dramatically smaller than Nyquist sampling limit as long as the un...
Hong Jung, Jaeheung Yoo, Jong Chul Ye