Sciweavers

161 search results - page 29 / 33
» An Application of Boosting to Graph Classification
Sort
View
FPL
2010
Springer
108views Hardware» more  FPL 2010»
13 years 5 months ago
FPGA Based Network Traffic Analysis Using Traffic Dispersion Patterns
The problem of Network Traffic Classification (NTC) has attracted significant amount of interest in the research community, offering a wide range of solutions at various levels. Th...
Faisal Khan, Maya Gokhale, Chen-Nee Chuah
IJHPCA
2006
125views more  IJHPCA 2006»
13 years 7 months ago
Complexity Results for Collective Communications on Heterogeneous Platforms
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...
Olivier Beaumont, Loris Marchal, Yves Robert
CHI
2008
ACM
14 years 8 months ago
PeerChooser: visual interactive recommendation
Collaborative filtering (CF) has been successfully deployed over the years to compute predictions on items based on a user's correlation with a set of peers. The black-box na...
Barry Smyth, Brynjar Gretarsson, John O'Donovan, S...
MM
2006
ACM
103views Multimedia» more  MM 2006»
14 years 1 months ago
Progressive cut
Recently, interactive image cutout technique becomes prevalent for image segmentation problem due to its easy-to-use nature. However, most existing stroke-based interactive object...
Chao Wang, Qiong Yang, Mo Chen, Xiaoou Tang, Zhong...
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 9 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...