Sciweavers

241 search results - page 19 / 49
» Path optimization for multiple objectives in directed graphs...
Sort
View
PAMI
2007
202views more  PAMI 2007»
13 years 7 months ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
14 years 2 months ago
Agglomerative genetic algorithm for clustering in social networks
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ï¬...
Marek Lipczak, Evangelos E. Milios
DASFAA
2009
IEEE
252views Database» more  DASFAA 2009»
14 years 2 months ago
Optimal Privacy-Aware Path in Hippocratic Databases
Abstract. Privacy becomes a major concern for both customers and enterprises in today’s corporate marketing strategies, many research efforts have been put into developing new p...
Min Li, Xiaoxun Sun, Hua Wang, Yanchun Zhang
TIP
2010
113views more  TIP 2010»
13 years 2 months ago
Multiplicative Noise Removal Using Variable Splitting and Constrained Optimization
Multiplicative noise (also known as speckle noise) models are central to the study of coherent imaging systems, such as synthetic aperture radar and sonar, and ultrasound and laser...
José M. Bioucas-Dias, Mário A. T. Fi...
PDPTA
2007
13 years 9 months ago
Two Graph Algorithms On an Associative Computing Model
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
Mingxian Jin, Johnnie W. Baker