Sciweavers

5595 search results - page 435 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
362
Voted
FUIN
2011
358views Cryptology» more  FUIN 2011»
14 years 10 months ago
Unsupervised and Supervised Learning Approaches Together for Microarray Analysis
In this article, a novel concept is introduced by using both unsupervised and supervised learning. For unsupervised learning, the problem of fuzzy clustering in microarray data as ...
Indrajit Saha, Ujjwal Maulik, Sanghamitra Bandyopa...
INFOCOM
2003
IEEE
16 years 4 days ago
Robust Monitoring of Link Delays and Faults in IP Networks
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
Yigal Bejerano, Rajeev Rastogi
180
Voted
GMP
2006
IEEE
155views Solid Modeling» more  GMP 2006»
16 years 28 days ago
Geometric Accuracy Analysis for Discrete Surface Approximation
In geometric modeling and processing, computer graphics and computer vision, smooth surfaces are approximated by discrete triangular meshes reconstructed from sample points on the...
Junfei Dai, Wei Luo, Shing-Tung Yau, Xianfeng Gu
167
Voted
ICPR
2010
IEEE
15 years 12 months ago
Maximum Likelihood Estimation of Gaussian Mixture Models Using Particle Swarm Optimization
—We present solutions to two problems that prevent the effective use of population-based algorithms in clustering problems. The first solution presents a new representation for ...
Caglar Ari, Selim Aksoy
192
Voted
VLDB
2004
ACM
120views Database» more  VLDB 2004»
16 years 6 days ago
Merging the Results of Approximate Match Operations
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Sr...