Sciweavers

228 search results - page 24 / 46
» A General Architecture for Finding Structural Regularities o...
Sort
View
EGH
2009
Springer
13 years 5 months ago
Fast minimum spanning tree for large graphs on the GPU
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
Vibhav Vineet, Pawan Harish, Suryakant Patidar, P....
PC
2010
177views Management» more  PC 2010»
13 years 6 months ago
Parallel graph component labelling with GPUs and CUDA
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne
WWW
2007
ACM
14 years 8 months ago
Extraction and classification of dense communities in the web
The World Wide Web (WWW) is rapidly becoming important for society as a medium for sharing data, information and services, and there is a growing interest in tools for understandi...
Yon Dourisboure, Filippo Geraci, Marco Pellegrini
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
13 years 9 months ago
An efficient algorithm for a class of fused lasso problems
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
Jun Liu, Lei Yuan, Jieping Ye
WSDM
2010
ACM
265views Data Mining» more  WSDM 2010»
14 years 5 months ago
Data-oriented Content Query System: Searching for Data into Text on the Web
As the Web provides rich data embedded in the immense contents inside pages, we witness many ad-hoc efforts for exploiting fine granularity information across Web text, such as We...
Kevin Chen-Chuan Chang, Mianwei Zhou, Tao Cheng