Sciweavers

1399 search results - page 93 / 280
» New Algorithms for k-Center and Extensions
Sort
View
ICASSP
2011
IEEE
13 years 24 days ago
A mutual information based approach for evaluating the quality of clustering
In this paper, a new method for evaluating the quality of clustering of genes is proposed based on mutual information criterion. Instead of using the conventional histogram-based ...
Shaikh Anowarul Fattah, Chia-Chun Lin, Sun-Yuan Ku...
JNCA
2011
102views more  JNCA 2011»
12 years 12 months ago
Multi-objective zone mapping in large-scale distributed virtual environments
In large-scale distributed virtual environments (DVEs), the NP-hard zone mapping problem concerns how to assign distinct zones of the virtual world to a number of distributed serv...
Ta Nguyen Binh Duong, Suiping Zhou, Wentong Cai, X...
PRL
2011
12 years 12 months ago
Structural matching of 2D electrophoresis gels using deformed graphs
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
Alexandre Noma, Alvaro Pardo, Roberto Marcondes Ce...
POPL
2012
ACM
12 years 4 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
CVPR
2012
IEEE
11 years 11 months ago
Seeded watershed cut uncertainty estimators for guided interactive segmentation
Watershed cuts are among the fastest segmentation algorithms and therefore well suited for interactive segmentation of very large 3D data sets. To minimize the number of user inte...
Christoph N. Straehle, Ullrich Köthe, Graham ...