Sciweavers

847 search results - page 87 / 170
» Approximation algorithms for projective clustering
Sort
View
ICASSP
2011
IEEE
14 years 4 months ago
SRF: Matrix completion based on smoothed rank function
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
Hooshang Ghasemi, Mohmmadreza Malek-Mohammadi, Mas...
107
Voted
ICDCN
2009
Springer
15 years 5 months ago
Optimizing Multi-hop Queries in ZigBee Based Multi-sink Sensor Networks
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
Bing Han, Gwendal Simon
122
Voted
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
15 years 10 months ago
Detecting Communities in Social Networks Using Max-Min Modularity.
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
Jiyang Chen, Osmar R. Zaïane, Randy Goebel
AFRIGRAPH
2003
ACM
15 years 4 months ago
Efficient clustering and visibility calculation for global illumination
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
Daniel Meneveaux, Kadi Bouatouch, Gilles Subrenat,...
122
Voted
IPMI
2009
Springer
15 years 7 months ago
Clustering of the Human Skeletal Muscle Fibers Using Linear Programming and Angular Hilbertian Metrics
In this paper, we present a manifold clustering method for the classification of fibers obtained from diffusion tensor images (DTI) of the human skeletal muscle. Using a linear ...
Radhouène Neji, Ahmed Besbes, Nikos Komodak...