Sciweavers

1964 search results - page 61 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
PKDD
2007
Springer
132views Data Mining» more  PKDD 2007»
14 years 1 months ago
An Algorithm to Find Overlapping Community Structure in Networks
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...
Steve Gregory
ISCAS
2002
IEEE
124views Hardware» more  ISCAS 2002»
14 years 21 days ago
Performance optimization of multiple memory architectures for DSP
Multiple memory module architecture offers higher performance by providing potentially doubled memory bandwidth. Two key problems in gaining high performance in this kind of archi...
Qingfeng Zhuge, Bin Xiao, Edwin Hsing-Mean Sha
EMSOFT
2004
Springer
14 years 1 months ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras
SAC
2006
ACM
14 years 1 months ago
Privacy-preserving SVM using nonlinear kernels on horizontally partitioned data
Traditional Data Mining and Knowledge Discovery algorithms assume free access to data, either at a centralized location or in federated form. Increasingly, privacy and security co...
Hwanjo Yu, Xiaoqian Jiang, Jaideep Vaidya
WALCOM
2007
IEEE
151views Algorithms» more  WALCOM 2007»
13 years 9 months ago
Base Station Placement Problem on the Boundary of a Convex Region
Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient systems for providing specialized services ha...
Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. ...