Sciweavers

4009 search results - page 241 / 802
» Clustering on Complex Graphs
Sort
View
EUROPAR
2005
Springer
15 years 11 months ago
A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
Erik G. Boman, Doruk Bozdag, Ümit V. Ç...
IPL
2006
72views more  IPL 2006»
15 years 5 months ago
Cayley graphs as models of deterministic small-world networks
Many real networks, including those in social, technological, and biological realms, are small-world networks. The two distinguishing characteristics of small-world networks are h...
Wenjun Xiao, Behrooz Parhami
COMAD
2009
15 years 6 months ago
A Simple and Efficient Lane Detection using Clustering and Weighted Regression
Developing a vision based, efficient and automatic lane detection system from a moving vehicle is a challenging task mainly due to poor quality of lane markings, occlusion created...
Rudra N. Hota, Shahanaz Syed, Subhadip Bandyopadhy...
COMCOM
2004
81views more  COMCOM 2004»
15 years 5 months ago
A performance anomaly in clustered on-line transaction processing systems
This paper presents a simulation study on complex On-Line Transaction Processing systems using TPC-C workload. The impacts on the response time of Inter-Connection Network (ICN) i...
Hong Cai, Hisao Kameda, Jie Li
CORR
2002
Springer
82views Education» more  CORR 2002»
15 years 5 months ago
Using eigenvectors of the bigram graph to infer morpheme identity
This paper describes the results of some experiments exploring statistical methods to infer syntactic categories from a raw corpus in an unsupervised fashion. It shares certain po...
Mikhail Belkin, John A. Goldsmith